Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields

DOI10.1515/MATH-2020-0086zbMATH Open1475.11139OpenAlexW3119721095MaRDI QIDQ2053545FDOQ2053545

Xiaolin 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

Recommendations

• scientific article; zbMATH DE number 7594564
• Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
• Large families of pseudorandom binary lattices by using the multiplicative inverse modulo \(P\)
• Measures of pseudorandomness of families of binary lattices. II: A further construction
• scientific article; zbMATH DE number 5247160

zbMATH Keywords

finite fieldcharacter sumpseudorandombinary latticecyclotomic class

Mathematics Subject Classification ID

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

Cites Work

• A complexity measure for families of binary sequences
• Some estimates for character sums and applications
• Equations over finite fields. An elementary approach
• On pseudorandom binary lattices
• Construction of pseudorandom binary lattices based on multiplicative characters
• 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
• Title not available (Why is that?)
• Construction of pseudorandom binary lattices by using the multiplicative inverse
• A large family of pseudorandom binary lattices
• Large families of pseudorandom binary sequences and lattices by using the multiplicative inverse
• On finite pseudorandom binary lattices
• Large families of pseudorandom sequences of k symbols and their complexity, Part II
• Large families of pseudorandom binary lattices by using the multiplicative inverse modulo P

Cited In (4)

• Construction of pseudorandom binary lattices based on multiplicative characters
• Construction of pseudorandom binary lattices using elliptic curves
• Title not available (Why is that?)
• Counting functions and expected values for the lattice profile at \(n\)

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

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