Pseudorandom Functions and Factoring
DOI10.1137/S0097539701389257zbMATH Open1013.94017OpenAlexW2067107502MaRDI QIDQ3149873FDOQ3149873
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
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
cryptographypseudorandomnessfactoringinteger factorizationpseudorandom functionscomputational number theoryBlum-Blum-Shub generatorBBS generatorNR method
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Pseudo-random numbers; Monte Carlo methods (11K45) Factorization (11Y05)
Cited In (18)
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Number-theoretic constructions of efficient pseudo-random functions
- Cryptography and Coding
- Pseudorandom properties of prime factors
- Performance improvement for the GGM-construction of pseudorandom functions
- Title not available (Why is that?)
- Pseudorandom functions: three decades later
- Adaptively secure constrained pseudorandom functions in the standard model
- Practical chosen ciphertext secure encryption from factoring
- Small bias requires large formulas
- Title not available (Why is that?)
- Pseudo-random functions and factoring (extended abstract)
- Building a pseudorandom function using a Naor-Reingold type construction
- On the security of modular exponentiation with application to the construction of pseudorandom generators
- The communication complexity of addition
- On optimal cryptographic key derivation
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)
