Cryptanalysis based on 2-adic rational approximation

DOI10.1007/3-540-44750-4_21MaRDI QIDQ4343440zbMATH OpenFDO

Authors Andrew Klapper, M. Goresky

Publication date 24 August 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_21

zbMATH Keywords

2-adic numbersalgorithmcryptanalysisfeedback with carry shift registerrational approximation

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• 2-adic shift registers
• Feedback registers based on ramified extensions of the 2-adic numbers. (Extended abstract)
• Fast correlation attacks on certain stream ciphers
• On a fast correlation attack on certain stream ciphers

Cited in

(22)

• Periods of termwise exclusive ors of maximal length FCSR sequences
• Feedback shift registers, 2-adic span, and combiners with memory
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
• 2-adic complexity of binary sequences with interleaved structure
• Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
• 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
• The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
• Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
• A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
• Expected values for the rational complexity of finite binary sequences
• AFSRs synthesis with the extended Euclidean rational approximation algorithm
• 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
• Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period 2p^n
• On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
• On the symmetric 2-adic complexity of periodic binary sequences
• Pattern sets for \(\mathbb{F}_q\)-sequences invariant under the continued fraction operator K (the Berlekamp-Massey algorithm)
• Linear complexity and 2-adic complexity of new cyclotomic binary sequences of order four with low autocorrelation
• The symmetric 2-adic complexity of Tang-Gong interleaved sequences from Legendre sequence pair
• On the 2-adic complexity of cyclotomic binary sequences of order four
• Linearity properties of binary FCSR sequences

This page was built for publication: Cryptanalysis based on 2-adic rational approximation

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