Quantum attacks on pseudorandom generators
From MaRDI portal
Recommendations
Cites work
- A Pseudorandom Generator from any One-way Function
- A Simple Unpredictable Pseudo-Random Number Generator
- An improved pseudo-random generator based on the discrete logarithm problem
- Cryptanalytic attacks on pseudorandom number generators
- Encyclopedia of Cryptography and Security
- Fast quantum modular exponentiation
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- How to predict congruential generators
- scientific article; zbMATH DE number 5081837 (Why is no real title available?)
- Logical Reversibility of Computation
- Mapping the discrete logarithm
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum computing
- The Discrete Logarithm Hides $O(\log n)$ Bits
- The discrete logarithm modulo a composite hides \(O(n)\) bits
This page was built for publication: Quantum attacks on pseudorandom generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4925033)