Next: RSA/Rabin Functions: Certain Parts
Up: The Post-Doctoral Period (1983-86)
Previous: The Weakest Pseudo-Random Generator
(The original motivation for this combinatorial study was the
analysis of certain oracle probing techniques that emerged from
the attempt to prove that the least significant bit is a hardcore
of the RSA function.)
Comments:
Authored by O. Goldreich. Appeared in
- Proceedings of Eurocrypt84,
Lecture Note in Computer Science (209) Springer Verlag,
pp. 127-141, 1985.
- Discrete Mathematics, Vol. 80, 1990, pp. 59-68.
Oded Goldreich
2003-07-30