A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
From MaRDI portal
Publication:2277233
DOI10.1007/BF00196912zbMath0724.94007OpenAlexW1981205339WikidataQ122884520 ScholiaQ122884520MaRDI QIDQ2277233
Jovan Dj. Golić, Miodrag J. Mihaljević
Publication date: 1991
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00196912
cryptanalysissequence comparisonLevenshtein distancecorrelation attackmemoryless functionclock-controlled shift registers
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
Constrained many-to-one string editing with memory, Mixer–a new stream cipher, A simple attack on some clock-controlled generators, A cryptanalysis of clock-controlled shift registers with multiple steps, Computation of edit probabilities and edit distances for the A5-type keystream generator
Cites Work
- Unnamed Item
- Unnamed Item
- Constrained string editing
- Fast correlation attacks on certain stream ciphers
- A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
- Recognition of Noisy Subsequences Using Constrained Edit Distances
- On the linear complexity of functions of periodic GF(q) sequences
- Longest common subsequences of two random sequences