Comparative Analysis of Random Generators

DOI10.1007/978-3-030-44559-1_10MaRDI QIDQ3387110zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

entropycryptographypseudorandomrandom generatorLinux/dev/random

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• scientific article; zbMATH DE number 3928174 (Why is no real title available?)
• scientific article; zbMATH DE number 1979300 (Why is no real title available?)
• scientific article; zbMATH DE number 3070755 (Why is no real title available?)
• A Simple Unpredictable Pseudo-Random Number Generator
• Fast parallel matrix and GCD computations
• Foundations of Cryptography
• Inferring sequences produced by pseudo-random number generators
• Information Security and Privacy
• Notions for RSA integers
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Stronger security proofs for RSA and Rabin bits.
• The complexity of theorem-proving procedures

Cited in

(1)

• Comparison of random number generators via Fourier transform

Describes a project that uses

Uses Software

• Nginx
• gmp

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)