On the use of expansion series for stream ciphers

DOI10.1112/S146115701200109XMaRDI QIDQ5169643zbMATH OpenOpenAlexWikidataFDO

Authors Claus Diem

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Cryptanalysis of some stream ciphers
• scientific article; zbMATH DE number 1196713
• scientific article; zbMATH DE number 30328
• Stream ciphers, a perspective. (Abstract)
• On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
• scientific article; zbMATH DE number 5529045
• On increasing the throughput of stream ciphers
• Stream Ciphers
• scientific article; zbMATH DE number 3912275
• When Stream Cipher Analysis Meets Public-Key Cryptography

Cites work

• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 611919 (Why is no real title available?)
• Explicit infrastructure for real quadratic function fields and real hyperelliptic curves
• Finiteness results for modular curves of genus at least 2
• On the discrete logarithm problem in class groups of curves
• Sequences with almost perfect linear complexity profiles and curves over finite fields
• The continued fraction algorithm and regulator for quadratic function fields of characteristic 2

Cited in

(12)

• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• Constructions of sequences with almost perfect linear complexity profile from curves over finite fields
• Perfect linear complexity profile and apwenian sequences
• On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
• On the \(N\)th linear complexity of automatic sequences
• Measures of pseudorandomness: arithmetic autocorrelation and correlation measure
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• Linear complexity and expansion complexity of some number theoretic sequences
• Algebraic dependence in generating functions and expansion complexity
• Pseudorandom sequences derived from automatic sequences
• Expansion complexity and linear complexity of sequences over finite fields
• On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence

Describes a project that uses

Uses Software

• Magma

This page was built for publication: On the use of expansion series for stream ciphers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169643)