Computation of edit probabilities and edit distances for the A5-type keystream generator
From MaRDI portal
Publication:1599209
DOI10.1006/JCOM.2001.0624zbMath1004.68067OpenAlexW1980467932MaRDI QIDQ1599209
Renato Menicocci, Jovan Dj. Golić
Publication date: 5 June 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2001.0624
Cites Work
- Stream cipher encryption of random access files
- Constrained many-to-one string editing with memory
- A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computation of edit probabilities and edit distances for the A5-type keystream generator