Another attack on A5/1
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
A5/1 is a stream cipher used in the Global System for Mobile Communications (GSM) standard. Several time-memory tradeoff attacks against A5/1 have been proposed, most notably the attack by Biryukov, Shamir and Wagner (1978), which can break A5/1 in seconds using huge precomputation time and memory. This article presents a completely different attack on A5/1, based on ideas from correlation attacks. Whereas time-memory tradeoff attacks have a complexity which is exponential with the shift-register length, the complexity of the proposed attack is almost independent of the shift-register length. Our implementation of the suggested attack breaks A5/1 in a few minutes using 2-5 min of conversation plaintext.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Real Time Cryptanalysis of A5/1 on a PC
Biryukov, A., Shamir, A., & Wagner, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_1 · Cited by 452
Cited by
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
Dunkelman, O., Keller, N., & Shamir, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_21 · Cited by 155
Babbage, S., & Dodd, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_15 · Cited by 143
Periods on Two Kinds of nonlinear Feedback Shift Registers with Time Varying Feedback Functions
HU, H., & GONG, G. (2011) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054111008738 · Cited by 51
Comparison of the hardware architectures and FPGA implementations of stream ciphers
Galanis, M. D., Kitsos, P., Kostopoulos, G., Sklavos, N., Koufopavlou, O., & Goutis, C. E. (2005) · Proceedings of the 2004 11th IEEE International Conference on Electronics, Circuits and Systems, 2004. ICECS 2004. · doi:10.1109/icecs.2004.1399745 · Cited by 43
Metadata
- Authors
- Ekdahl, P., & Johansson, T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-01
- Volume
- 49
- Issue
- 1
- Pages
- 284-289
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2097140439
- Cited by
- 141
- References
- 2
- FWCI
- 10.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.