Linear complexity profile of \(m\)-ary pseudorandom sequences with small correlation measure
From MaRDI portal
Publication:633044
DOI10.1016/S0019-3577(09)80030-XzbMath1237.11034MaRDI QIDQ633044
Publication date: 31 March 2011
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-3577(09)80030-x
discrete logarithm; Legendre sequence; correlation measure; quaternary sequence; Linear complexity profile; \(m\)-ary sequence
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
11K36: Well-distributed sequences and other variations
Related Items
Linear complexity and trace representation of balanced quaternary cyclotomic sequences of prime period \(p\), On the linear complexity of binary lattices, On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences, Multiplicative character sums of Fermat quotients and pseudorandom sequences, On pseudorandom sequences of \(k\) symbols constructed using finite fields, Linear complexity profile and correlation measure of interleaved sequences, Hamming correlation of higher order, Construction of k-ary pseudorandom elliptic curve sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the pseudorandomness of binary and quaternary sequences linked by the Gray mapping
- Equations over finite fields. An elementary approach
- On finite pseudorandom sequences of \(k\) symbols.
- On finite pseudorandom sequences of \(k\) symbols
- Linear complexity profile of binary sequences with small correlation measure
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- 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