Attacks on pseudo random number generators hiding a linear structure

DOI10.1007/978-3-030-95312-6_7zbMath1501.94049OpenAlexW4226372749MaRDI QIDQ2152156

Florette Martinez

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-95312-6_7

zbMATH Keywords

knapsack problemcryptanalysispseudo-random number generatorsCoppersmith methods

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• NumPy
• AS 183

Cites Work

• Factoring polynomials with rational coefficients
• Lattice reduction: a toolbox for the cryptoanalyst
• Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness
• Cryptanalysis of the Knapsack Generator
• Subset sum pseudorandom numbers: fast generation and distribution
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Mean, Median and Mode in Binomial Distributions
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants

This page was built for publication: Attacks on pseudo random number generators hiding a linear structure