Pseudo-randomness of certain sequences of k symbols with length pq
From MaRDI portal
Publication:2434527
DOI10.1007/S11390-011-9434-5zbMATH Open1280.11042OpenAlexW4248868140MaRDI QIDQ2434527FDOQ2434527
Authors: Yanyan Li 
Publication date: 6 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-011-9434-5
Recommendations
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- A large family of pseudorandom sequences of \(k\) symbols with length \(pq\)
- Large family of pseudorandom sequence of \(k\) symbols with length \(pq\)
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- More constructions of pseudorandom sequences of \(k\) symbols
discrete logarithmcharacter sumscorrelation measurepseudo-random sequencesstream cipherswell-distribution measuremodulo \(pq\) residue class rings
Cites Work
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- Title not available (Why is that?)
- Autocorrelation values of generalized cyclotomic sequences of order two
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Remarks on a cyclotomic sequence
- Linear complexity and related complexity measures
- Progress in Cryptology - INDOCRYPT 2003
- Modular constructions of pseudorandom binary sequences with composite moduli
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\)
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\)
- Sequences related to Legendre/Jacobi sequences
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- On finite pseudorandom sequences of \(k\) symbols.
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- On finite pseudorandom lattices of \(k\) symbols
- On finite pseudorandom sequences of \(k\) symbols
Cited In (11)
- Large family of pseudorandom sequence of \(k\) symbols with length \(pq\)
- On the correlation of families of pseudorandom sequences of \(k\) symbols
- A large family of pseudorandom sequences of \(k\) symbols with length \(pq\)
- On finite pseudorandom sequences of \(k\) symbols
- Large family of pseudorandom sequences of \(k\) symbols constructed by using multiplicative character
- On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences
- On pseudorandom binary sequences constructed by using finite fields
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
- On finite pseudorandom lattices of \(k\) symbols
This page was built for publication: Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434527)
