Paper 2000/064
On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators
Oded Goldreich and Vered Rosen
Abstract
Assuming the inractability of factoring, we show that
the output of the exponentiation modulo a composite function
Metadata
- Available format(s)
- PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Modular exponentiationdiscrete logarithmhard core predicatessimultaneous securitypseudorandom generatorfactoring assumption.
- Contact author(s)
- oded @ narkis wisdom weizmann ac il
- History
- 2000-12-07: received
- Short URL
- https://ia.cr/2000/064
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2000/064, author = {Oded Goldreich and Vered Rosen}, title = {On the Security of Modular Exponentiation with Application to the Construction of Pseudorandom Generators}, howpublished = {Cryptology {ePrint} Archive, Paper 2000/064}, year = {2000}, url = {https://eprint.iacr.org/2000/064} }