The MICKEY Stream Ciphers
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
(2020) · Lecture notes in computer science · doi:10.1007/978-3-030-64840-4 · Cited by 455
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 1×
“When we say that we can perform BSW sampling [8] with a sampling factor W , we mean that:”
MethodCryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
Biryukov, A., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_1 · Cited by 339 · cited 7×
“TMD tradeoff against MICKEY version 1 Hong and Kim [12] show that BSW sampling can be performed on MICKEY version 1 with a sampling factor W = 227.”
BackgroundInfluentialImproved “exhaustive search” attacks on stream ciphers
Babbage, S. H. (1995) · European Convention on Security and Detection · doi:10.1049/cp:19950490 · Cited by 171 · cited 1×
“[1]) have recommended that the state size of a keystream generator should be at least twice the key size, to protect against what is now usually called the Babbage-Golić TMD attack.”
BackgroundSelf-citationEkdahl, P., & Johansson, T. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.806129 · Cited by 141
An Improved Correlation Attack on A5/1
Maximov, A., Johansson, T., & Babbage, S. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30564-4_1 · Cited by 74 · cited 1×
“Again, this can be used to make attacks more efficient — see [10, 15 ] for an example.”
MethodSelf-citationMadhavan, C. E. V., Venkatesan, R., & Maitra, S. (2005) · Lecture notes in computer science · doi:10.1007/11596219 · Cited by 70
Research works printed but not linked: 4
- Babbage, S.H., Dodd, M.W.: The stream cipher MICKEY (version 1), Algorithm specification Issue 1.0. In: ECRYPT stream cipher submission, in the proceedings of the SKEW Workshop, Århus (May 2005), http://www.ecrypt.eu.org/stream/ciphers/mickey/mickey.pdf
- Babbage, S.H., Dodd, M.W.: The stream cipher MICKEY-128 (version 1), Algorithm specification Issue 1.0. In: ECRYPT stream cipher submission, in the proceedings of the SKEW Workshop, Århus (May 2005), http://www.ecrypt.eu.org/stream/ciphers/mickey128/mickey128.pdf
- Dawson, E., Clark, A., Golić, J., Millan, W., Penna, L., Simpson, L.: The LILI-128 Keystream Generator, NESSIE submission. In: proceedings of the First Open NESSIE Workshop, Leuven (November 2000), http://www.cryptonessie.org
- Jansen, C.J.A.: Streamcipher Design: Make your LFSRs jump!, presented at the ECRYPT SASC (State of the Art in Stream Ciphers) workshop. In: the workshop record, Bruges (October 2004), http://www.isg.rhul.ac.uk/research/projects/ecrypt/stvl/sasc-record.zip
Cited by
PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
Borghoff, J., Canteaut, A., Güneysu, T., Kavun, E. B., Knezevic, M., Knudsen, L. R., Leander, G., Nikov, V., Paar, C., Rechberger, C., et al. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-34961-4_14 · Cited by 750
Advanced lightweight encryption algorithms for IoT devices: survey, challenges and solutions
Singh, S., Sharma, P. K., Moon, S. Y., & Park, J. H. (2024) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-017-0494-4 · Cited by 444
“Competition final-ists were announced in 2008 and included the three stream ciphers of Grain (Hell et al. 2007), MICKEY (Babbage and Dodd 2008) and Trivium (Kitsos et al. 2013) for hardware applications with limited resources.”
spongent: A Lightweight Hash Function
Bogdanov, A., Knežević, M., Leander, G., Toz, D., Varıcı, K., & Verbauwhede, I. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_21 · Cited by 354
Report on lightweight cryptography
McKay, K. A., Bassham, L., Turan, M. S., & Mouha, N. (2017) · doi:10.6028/nist.ir.8114 · Cited by 353
Lightweight Cryptography: A Solution to Secure IoT
Dhanda, S. S., Singh, B., & Jindal, P. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07134-3 · Cited by 294
“Other important ciphers of this generation are MICKEY [77], Chacha [78] Encoro 80 [79], Encoro 128 [80], SNOW-3G [81], A2U2 [82], and Quavium [83].”
Background
Metadata
- Authors
- Babbage, S., & Dodd, M.
- Affiliations
- Vodafone (United Kingdom) (GB)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008-08-12
- Pages
- 191-209
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1573222895
- Cited by
- 143
- References
- 13
- Citations by year
- 2026: 5 · 2025: 5 · 2024: 6 · 2023: 4 · 2022: 13 · 2021: 8 · 2020: 8 · 2019: 12 · 2018: 8 · 2017: 8 · 2016: 5 · 2015: 11 · 2014: 17 · 2013: 6 · 2012: 9
- FWCI
- 4.46
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
- Keywords
- shift registers, keystream generation, resource-constrained devices, hardware security, pseudorandomness, cryptanalysis resistance
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The MICKEY Stream Ciphers. https://app.cochat.ai/papers/10.1007/978-3-540-68351-3_15
- The paper
- Babbage, S., & Dodd, M. (2008). The MICKEY Stream Ciphers. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-68351-3_15
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.