Sequences with almost perfect linear complexity profiles and curves over finite fields

DOI10.1109/18.761282zbMath0943.94008OpenAlexW2104436223MaRDI QIDQ4701382

Kwok-Yan Lam, Xing, Chaoping

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.761282

zbMATH Keywords

linear complexity profilestream cipherscurves over finite fieldspseudorandom sequencesalmost perfect sequences

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Finite ground fields in algebraic geometry (14G15) Random number generation in numerical analysis (65C10)

Related Items (7)

Pseudorandom sequences derived from automatic sequences ⋮ Construction of sequences with high nonlinear complexity from a generalization of the Hermitian function field ⋮ On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence ⋮ ON THE -ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS ⋮ Multisequences with almost perfect linear complexity profile and function fields over finite fields ⋮ On the use of expansion series for stream ciphers ⋮ Multi-sequences with \(d\)-perfect property

This page was built for publication: Sequences with almost perfect linear complexity profiles and curves over finite fields