Pseudorandom Functions and Factoring

DOI10.1137/S0097539701389257MaRDI QIDQ3149873zbMATHOpenAlexFDO

Authors Moni Naor, Omer Reingold, Alon Rosen

Publication date 29 September 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539701389257

zbMATH Keywords

cryptographypseudorandomnessfactoringinteger factorizationpseudorandom functionscomputational number theoryBlum-Blum-Shub generatorBBS generatorNR method

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45) Factorization (11Y05)

Recommendations

• Pseudo-random functions and factoring (extended abstract)
• Number-theoretic constructions of efficient pseudo-random functions
• scientific article; zbMATH DE number 1952891
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• scientific article; zbMATH DE number 3928174

Cited in

(18)

• Pseudorandom properties of prime factors
• Pseudo-random functions and factoring (extended abstract)
• Practical Chosen Ciphertext Secure Encryption from Factoring
• Building a pseudorandom function using a Naor-Reingold type construction
• A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
• Number-theoretic constructions of efficient pseudo-random functions
• Adaptively secure constrained pseudorandom functions in the standard model
• Practical chosen ciphertext secure encryption from factoring
• Cryptography and Coding
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Performance improvement for the GGM-construction of pseudorandom functions
• On optimal cryptographic key derivation
• Small bias requires large formulas
• Pseudorandom functions: three decades later
• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• scientific article; zbMATH DE number 1952891 (Why is no real title available?)
• The communication complexity of addition
• scientific article; zbMATH DE number 2119690 (Why is no real title available?)

This page was built for publication: Pseudorandom Functions and Factoring

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