Now showing items 1-1 of 1
Learning noisy characters, multiplication codes, and cryptographic hardcore predicates
(Massachusetts Institute of Technology, 2008)
We present results in cryptography, coding theory and sublinear algorithms. In cryptography, we introduce a unifying framework for proving that a Boolean predicate is hardcore for a one-way function and apply it to a broad ...