On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields

DOI10.1109/TIT.2007.899532zbMath1325.94109OpenAlexW2157024213MaRDI QIDQ3548990

Lei Hu, Dengguo Feng, Hong Gang Hu

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2007.899532

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (7)

Lattice-based key exchange on small integer solution problem ⋮ Predicting the elliptic curve congruential generator ⋮ Zero-knowledge proofs of retrievability ⋮ The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function ⋮ ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ Multisequences with large linear and \(k\)-error linear complexity from a tower of Artin-Schreier extensions of function fields ⋮ A family of elliptic curve pseudorandom binary sequences

This page was built for publication: On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields