Comparative Analysis of Random Generators

DOI10.1007/978-3-030-44559-1_10OpenAlexW3089702008MaRDI QIDQ3387110

Jan Lühr, Johannes vom Dorp, Simon Schneider, Daniel Loebenberger, Joachim von zur Gathen

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

zbMATH Keywords

entropycryptographypseudorandomrandom generatorLinux/dev/random

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Uses Software

• gmp
• Nginx

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions for RSA integers
• Stronger security proofs for RSA and Rabin bits.
• A Simple Unpredictable Pseudo-Random Number Generator
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Inferring sequences produced by pseudo-random number generators
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Foundations of Cryptography
• Fast parallel matrix and GCD computations
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• Information Security and Privacy
• The complexity of theorem-proving procedures

This page was built for publication: Comparative Analysis of Random Generators