Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\)
From MaRDI portal
Publication:2434527
DOI10.1007/s11390-011-9434-5zbMath1280.11042MaRDI QIDQ2434527
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
stream ciphers; character sums; pseudo-random sequences; discrete logarithm; correlation measure; well-distribution measure; modulo \(pq\) residue class rings
Related Items
On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences, On pseudorandom binary sequences constructed by using finite fields, Linear complexity and trace representation of quaternary sequences over \(\mathbb {Z}_{4}\) based on generalized cyclotomic classes modulo \( pq\)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\)
- Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\)
- Remarks on a cyclotomic sequence
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- On finite pseudorandom sequences of \(k\) symbols.
- On finite pseudorandom sequences of \(k\) symbols
- Sequences related to Legendre/Jacobi sequences
- Modular constructions of pseudorandom binary sequences with composite moduli
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- Autocorrelation values of generalized cyclotomic sequences of order two
- Progress in Cryptology - INDOCRYPT 2003
- 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
