Comparative Analysis of Random Generators
From MaRDI portal
Publication:3387110
DOI10.1007/978-3-030-44559-1_10OpenAlexW3089702008MaRDI QIDQ3387110FDOQ3387110
Authors: Johannes vom Dorp, Joachim von zur Gathen, Daniel Loebenberger, Jan Lühr, Simon Schneider 
Publication date: 12 January 2021
Published in: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-44559-1_10
Cites Work
- The complexity of theorem-proving procedures
- Foundations of Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A Simple Unpredictable Pseudo-Random Number Generator
- Title not available (Why is that?)
- Fast parallel matrix and GCD computations
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Stronger security proofs for RSA and Rabin bits.
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- Title not available (Why is that?)
- Notions for RSA integers
- Title not available (Why is that?)
- Information Security and Privacy
- Inferring sequences produced by pseudo-random number generators
Cited In (1)
Uses Software
This page was built for publication: Comparative Analysis of Random Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387110)
