Pages that link to "Item:Q3800123"
From MaRDI portal
The following pages link to Reconstructing Truncated Integer Variables Satisfying Linear Congruences (Q3800123):
Displaying 30 items.
- A new privacy homomorphism and applications (Q673242) (← links)
- On pseudorandom numbers from multivariate polynomial systems (Q708433) (← links)
- A generator of pseudo-random numbers sequences with a very long period (Q815410) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Inferring sequences produced by a linear congruential generator missing low-order bits (Q1121239) (← links)
- Binary sequences derived from ML-sequences over rings. I: Periods and minimal polynomials (Q1202920) (← links)
- Lattice reduction: a toolbox for the cryptoanalyst (Q1272333) (← links)
- Distribution of Hermite's constant and the shortest vector in lattices of dimension two (Q1340684) (← links)
- Predicting masked linear pseudorandom number generators over finite fields (Q1949235) (← links)
- Estimates of lengths of shortest nonzero vectors in some lattices. II (Q2081017) (← links)
- Estimates of lengths of shortest nonzero vectors in some lattices. I (Q2088732) (← links)
- Attacks on pseudo random number generators hiding a linear structure (Q2152156) (← links)
- Predicting truncated multiple recursive generators with unknown parameters (Q2182075) (← links)
- Quantum period reconstruction of approximate sequences (Q2379974) (← links)
- Pseudorandom numbers and hash functions from iterations of multivariate polynomials (Q2380848) (← links)
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves (Q2572963) (← links)
- Attacking the linear congruential generator on elliptic curves via lattice techniques (Q2673768) (← links)
- An improved method for predicting truncated multiple recursive generators with unknown parameters (Q2701486) (← links)
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász (Q3033847) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347) (← links)
- On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators (Q3584787) (← links)
- A natural lattice basis problem with applications (Q4396454) (← links)
- JEROBOAM (Q4639440) (← links)
- Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation (Q4806399) (← links)
- Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
- Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
- On elliptic curve $L$-functions integrated encryption scheme (Q6196946) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
