On the linear complexity of Legendre-Sidelnikov sequences
From MaRDI portal
Publication:2260798
DOI10.1007/s10623-013-9889-1zbMath1342.94098OpenAlexW1971806725MaRDI QIDQ2260798
Publication date: 12 March 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9889-1
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Random number generation in numerical analysis (65C10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of generalized cyclotomic binary sequences of order 2
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Correlation of the two-prime Sidel'nikov sequence
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- On the d-ary Generalized Legendre-Sidelnikov Sequence
- Autocorrelation values of generalized cyclotomic sequences of order two
- Autocorrelation of Legendre–Sidelnikov Sequences
- Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik.