On the use of expansion series for stream ciphers
From MaRDI portal
Publication:5169643
DOI10.1112/S146115701200109XzbMath1344.11086OpenAlexW2158323623WikidataQ122498025 ScholiaQ122498025MaRDI QIDQ5169643
Publication date: 11 July 2014
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s146115701200109x
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (10)
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values ⋮ Pseudorandom sequences derived from automatic sequences ⋮ Algebraic dependence in generating functions and expansion complexity ⋮ Measures of Pseudorandomness: Arithmetic Autocorrelation and Correlation Measure ⋮ On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence ⋮ On the \(N\)th linear complexity of automatic sequences ⋮ Expansion complexity and linear complexity of sequences over finite fields ⋮ Perfect linear complexity profile and apwenian sequences ⋮ Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The continued fraction algorithm and regulator for quadratic function fields of characteristic 2
- On the discrete logarithm problem in class groups of curves
- Finiteness results for modular curves of genus at least 2
- Explicit infrastructure for real quadratic function fields and real hyperelliptic curves
- Sequences with almost perfect linear complexity profiles and curves over finite fields
This page was built for publication: On the use of expansion series for stream ciphers
