On the security of modular exponentiation with application to the construction of pseudorandom generators

DOI10.1007/s00145-002-0038-7zbMath1040.94006OpenAlexW1979828147MaRDI QIDQ1402365

Oded Goldreich, Vered Rosen

Publication date: 27 August 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-002-0038-7

zbMATH Keywords

modular exponentiationpseudorandom generatorhard-core predicatediscrete logarithmsimultaneous securityfactoring assumption

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (5)

More efficient DDH pseudorandom generators ⋮ Paillier's trapdoor function hides \(\Theta(n)\) bits ⋮ Soficity, short cycles, and the Higman group ⋮ Short cycles in repeated exponentiation modulo a prime ⋮ Distribution of exponential functions modulo a prime power

This page was built for publication: On the security of modular exponentiation with application to the construction of pseudorandom generators