Next: Proofs that Yield Nothing
Up: The Post-Doctoral Period (1983-86)
Previous: The Bit Security of
It is shown that the GMR signature scheme can be made memoryless
as well as implemented in time comparable to a few RSA computations.
Comments:
Authored by O. Goldreich. Appeared in
- Crypto86 (Proceedings),
Lecture Note in Computer Science (263) Springer Verlag,
pp. 104-110, 1987.
Oded Goldreich
2003-07-30