Predicting the elliptic curve congruential generator
From MaRDI portal
Publication:2363380
DOI10.1007/s00200-016-0303-xzbMath1369.11099arXiv1609.03305OpenAlexW2514154808MaRDI QIDQ2363380
Publication date: 19 July 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.03305
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Computer solution of Diophantine equations (11Y50) Elliptic curves (14H52) Pseudo-random numbers; Monte Carlo methods (11K45) Calculation of integer sequences (11Y55)
Related Items (4)
Inferring sequences produced by elliptic curve generators using Coppersmith's methods ⋮ Attacking the linear congruential generator on elliptic curves via lattice techniques ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ Pseudorandom vector generation using elliptic curves and applications to Wiener processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Elliptic curve analogue of Legendre sequences
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
- On lattice profile of the elliptic curve linear congruential generators
- A family of elliptic curve pseudorandom binary sequences
- On the linear complexity and multidimensional distribution of congruential generators over elliptic curves
- Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm
- Pseudorandom Points on Elliptic Curves over Finite Fields
- On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
- Large families of elliptic curve pseudorandom binary sequences
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
This page was built for publication: Predicting the elliptic curve congruential generator
