On the Provable Security of an Efficient RSA-Based Pseudorandom Generator

DOI10.1007/11935230_13zbMath1172.94597OpenAlexW2171042141WikidataQ59485062 ScholiaQ59485062MaRDI QIDQ5459079

Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_13

zbMATH Keywords

RSAlattice attackprovable securityPseudorandom generator

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (11)

More efficient DDH pseudorandom generators ⋮ A new framework for deniable secure key exchange ⋮ Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials ⋮ On the power generator and its multivariate analogue ⋮ Predicting masked linear pseudorandom number generators over finite fields ⋮ Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ ⋮ A fast pseudorandom number generator with BLAKE hash function ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ QUAD: A multivariate stream cipher with provable security ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Comparative Analysis of Random Generators

This page was built for publication: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator