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

DOI10.1109/TIT.2007.899532MaRDI QIDQ3548990zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548990)