An improved pseudorandom generator based on hardness of factoring

DOI10.1007/3-540-36413-7_7MaRDI QIDQ4414270zbMATH OpenFDO

Authors Nenad Dedić, Leonid Reyzin, Salil Vadhan

Publication date 24 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2576/25760088.htm

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On the security of modular exponentiation with application to the construction of pseudorandom generators
• An improved pseudo-random generator based on discrete log
• An efficient discrete log pseudo random generator
• scientific article; zbMATH DE number 3928174
• Pseudorandom Functions and Factoring

Cited in

(8)

• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Pseudorandom Functions and Factoring
• Pseudo-random functions and factoring (extended abstract)
• An improved pseudo-random generator based on discrete log
• scientific article; zbMATH DE number 7528580 (Why is no real title available?)
• Cryptography and Coding
• The one-wayness of Jacobi signatures
• An improved pseudo-random generator based on the discrete logarithm problem

This page was built for publication: An improved pseudorandom generator based on hardness of factoring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414270)