An improved method for predicting truncated multiple recursive generators with unknown parameters

DOI10.1007/s10623-022-01175-4OpenAlexW4315482659MaRDI QIDQ2701486

Yanyan Li

Publication date: 28 April 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01175-4

zbMATH Keywords

lattice reductiontruncated predictionmultiple recursive generatorsthe resultant

Mathematics Subject Classification ID

Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Sequences (mod (m)) (11B50) Pseudo-random numbers; Monte Carlo methods (11K45)

Uses Software

• NTL
• fpLLL
• MRG32k3a
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring sequences produced by a linear congruential generator missing low-order bits
• Factoring polynomials with rational coefficients
• On fast multiplication of polynomials over arbitrary algebras
• Lattice reduction: a toolbox for the cryptoanalyst
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
• Predicting truncated multiple recursive generators with unknown parameters
• The general sieve kernel and new records in lattice reduction
• Predicting the elliptic curve congruential generator
• On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2
• On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
• Modern Computer Algebra
• Finding a Small Root of a Univariate Modular Equation
• Reconstruction of a linear recurrence of maximal period over a Galois ring from its highest coordinate sequence
• Linear Recurring Sequences
• Efficient and portable multiple recursive generators of large order
• A system of high-dimensional, efficient, long-cycle and portable uniform random number generators
• COMMON FACTORS OF RESULTANTS MODULO p
• Shift Register Synthesis (Modulo m)
• Deciphering a linear congruential encryption
• Minkowski's Convex Body Theorem and Integer Programming
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Inferring sequences produced by pseudo-random number generators
• A method for solving key equation for decoding goppa codes
• Continued Fractions and Linear Recurrences
• Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
• Secure and Fast Encryption (SAFE) with Classical Random Number Generators
• The Arithmetical Theory of Linear Recurring Series
• A sieve algorithm for the shortest lattice vector problem
• Hermite’s Constant and Lattice Algorithms
• Predicting Lattice Reduction
• Information Security and Privacy
• Fourier Analysis of Uniform Random Number Generators
• Shift-register synthesis and BCH decoding
• Algorithmic Number Theory

This page was built for publication: An improved method for predicting truncated multiple recursive generators with unknown parameters