Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves

DOI10.1007/s11766-012-2465-zzbMath1265.11079OpenAlexW2182457359MaRDI QIDQ1931130

Yanyan Li

Publication date: 24 January 2013

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-012-2465-z

zbMATH Keywords

elliptic curvecharacter sumLegendre symbolquasi-randomnessquasi-random subset

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) Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Other character sums and Gauss sums (11T24) Well-distributed sequences and other variations (11K36)

Cites Work

• Elliptic curve analogue of Legendre sequences
• On large families of subsets of the set of the integers not exceeding \(N\)
• On pseudo-random subsets of \({\mathbb{Z}}_n\)
• Quasi-random subsets of \(\mathbb{Z}_ n\)
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• Elliptic Curves and Their Applications to Cryptography
• Multiplicative character sums and Kummer coverings
• Quasi-Random Set Systems
• Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves