Pseudorandom Functions and Factoring
From MaRDI portal
Publication:3149873
DOI10.1137/S0097539701389257zbMath1013.94017OpenAlexW2067107502MaRDI QIDQ3149873
Omer Reingold, Alon Rosen, Moni Naor
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
cryptographypseudorandom functionsBlum-Blum-Shub generatorpseudorandomnessfactoringinteger factorizationcomputational number theoryBBS generatorNR method
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Pseudo-random numbers; Monte Carlo methods (11K45) Factorization (11Y05)
Related Items (8)
Performance improvement for the GGM-construction of pseudorandom functions ⋮ On optimal cryptographic key derivation ⋮ Unnamed Item ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ The communication complexity of addition ⋮ 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 ⋮ Adaptively secure constrained pseudorandom functions in the standard model
This page was built for publication: Pseudorandom Functions and Factoring