Large families of pseudorandom binary lattices by using the multiplicative inverse modulo P

DOI10.1142/S1793042119500271zbMath1476.11110OpenAlexW2897289237WikidataQ129161083 ScholiaQ129161083MaRDI QIDQ4629107

Huaning Liu

Publication date: 25 March 2019

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042119500271

zbMATH Keywords

collisionpseudorandom measuresmultiplicative inversehyper-Kloosterman sumsavalanche effectpseudorandom binary lattices

Mathematics Subject Classification ID

Estimates on exponential sums (11L07) Gauss and Kloosterman sums; generalizations (11L05) Trigonometric and exponential sums (general theory) (11L03) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function, Unnamed Item, Constructions of pseudorandom binary lattices using cyclotomic classes in finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of pseudorandom binary lattices based on multiplicative characters
• On a trigonometric sum of Vinogradov.
• 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)
• Exponential Sums and Goppa Codes: I
• On pseudorandom binary lattices
• On Some Exponential Sums