Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields

DOI10.1515/math-2020-0086zbMath1475.11139OpenAlexW3119721095MaRDI QIDQ2053545

Xiao-Lin Chen

Publication date: 29 November 2021

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2020-0086

zbMATH Keywords

finite fieldcharacter sumpseudorandombinary latticecyclotomic class

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Other character sums and Gauss sums (11T24) Sequences (mod (m)) (11B50) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Unnamed Item
• On finite pseudorandom binary lattices
• Construction of pseudorandom binary lattices based on multiplicative characters
• Equations over finite fields. An elementary approach
• A complexity measure for families of binary sequences
• Construction of pseudorandom binary lattices by using the multiplicative inverse
• Measures of pseudorandomness of families of binary lattices, I (Definitions, a construction using quadratic characters)
• Measures of pseudorandomness of families of binary lattices, II (A further construction)
• On pseudorandom binary lattices
• Large families of pseudorandom sequences of k symbols and their complexity, Part II
• A large family of pseudorandom binary lattices
• Large families of pseudorandom binary lattices by using the multiplicative inverse modulo P
• Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse
• Some estimates for character sums and applications

This page was built for publication: Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields