Large family of pseudorandom binary lattices by using the quadratic character in finite fields
From MaRDI portal
Publication:3380690
zbMATH Open1488.11115MaRDI QIDQ3380690FDOQ3380690
Authors: Huaning Liu, Keyao Li
Publication date: 29 September 2021
Recommendations
- scientific article; zbMATH DE number 5247160
- A large family of pseudorandom binary lattices
- scientific article; zbMATH DE number 7594564
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- Large families of pseudorandom binary lattices by using the multiplicative inverse modulo \(P\)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Pseudo-random numbers; Monte Carlo methods (11K45) Other character sums and Gauss sums (11T24)
Cited In (7)
- Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
- A large family of pseudorandom binary lattices
- Large families of pseudorandom binary lattices by using the multiplicative inverse modulo \(P\)
- Construction of pseudorandom binary lattices based on multiplicative characters
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Large family of pseudorandom binary lattices by using the quadratic character in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380690)