Quantum attacks on pseudorandom generators

DOI10.1017/S0960129512000825zbMath1353.81034OpenAlexW2015250753MaRDI QIDQ4925033

Bernardo Jun. Lula, Elloá B. Guedes, Francisco M. De Assis

Publication date: 11 June 2013

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129512000825

zbMATH Keywords

pseudorandom generatorspolynomial time quantum attack on Blum-Micali generator

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Random number generation in numerical analysis (65C10) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• An improved pseudo-random generator based on the discrete logarithm problem
• Mapping the discrete logarithm
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• Fast quantum modular exponentiation
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Simple Unpredictable Pseudo-Random Number Generator
• The Discrete Logarithm Hides $O(\log n)$ Bits
• How to predict congruential generators
• A Pseudorandom Generator from any One-way Function
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Cryptanalytic Attacks on Pseudorandom Number Generators
• Encyclopedia of Cryptography and Security
• Logical Reversibility of Computation
• Quantum computing

This page was built for publication: Quantum attacks on pseudorandom generators