The DOI matches its Crossref record; 52 of the 53 references it cites were found in a registry or an index.
KLEIN: A New Family of Lightweight Block Ciphers
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Different lightweight ciphers were presented recently and described in [19], including KATAN [287], KLEIN [288], mCrypton [289], Piccolo [290], PRESENT [291], TWINE [292], and EPCBC [293].”
From Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations (2022) · cites this paper as [288]
Citations
Cites
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867 · cited 3×
“In the literature, quite a few lightweight block ciphers with various design strategies have been proposed [3,6,13,18,22,27,33,35,42,52].”
BackgroundMethodThe design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
Daemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718 · cited 1×
“For a hardware implementation, a complete-including the analog part-low-cost RFID tag might have between 1,000 and 10,000 GE, and for security components may occupy up to 2,000 GE [25].”
HIGHT: A New Block Cipher Suitable for Low-Resource Device
Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.-S., Lee, C., Chang, D., Lee, J., Jeong, K., et al. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_4 · Cited by 708 · cited 2×
“[21] as a generalized Feistel-like cipher, which is suitable for lowresource devices.”
BackgroundA Compact Rijndael Hardware Architecture with S-Box Optimization
Satoh, A., Morioka, S., Takano, K., & Munetoh, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_15 · Cited by 683
KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
De Cannière, C., Dunkelman, O., & Knežević, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04138-9_20 · Cited by 678 · cited 5×
“In the literature, quite a few lightweight block ciphers with various design strategies have been proposed [3,6,13,18,22,27,33,35,42,52].”
BackgroundInfluentialCryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Biham, E., Biryukov, A., & Adi Shamir, Z. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_2 · Cited by 582
Pushing the Limits: A Very Compact and a Threshold Implementation of AES
Moradi, A., Poschmann, A., Ling, S., Paar, C., & Wang, H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_6 · Cited by 463 · cited 2×
“AES-128 [51] [24] [40] 0.”
Knudsen, L. R., & Wagner, D. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45661-9_9 · Cited by 460 · cited 16×
“HIGHT is less attractive since its area in GE is over 3000 GE, which is less competitive to the best AES implementations by Moradi et al. [40] (with 2400 GE), Hamalainen et al. [24] (with 3100 GE) and Feldhofer et al. [20] (with 3400 GE).”
BackgroundMethodInfluential
Research works printed but not linked: 3
- Chipcon: CC2420: 2.4 GHz IEEE 802.15.4/Zigbee-ready RF transceiver, http://focus.ti.com/lit/ds/symlink/cc2420.pdf
- Mangard, S., Standaert, F.X. (eds.): CHES 2010. LNCS, vol. 6225. Springer, Heidelberg (2010)
- Poschmann, A.: Lightweight Cryptography - Cryptographic Engineering for a PervasiveWorld. PhD thesis, Ruhr-University Bochum, Germany (2009)
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
“For the same time constraints and technologies, PRINCE uses 6-7 times less area than PRESENT-80 and 14-15 times less area than AES-128.”
MethodInfluentialGuo, J., Peyrin, T., Poschmann, A., & Robshaw, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_22 · Cited by 773
“This is something that has already been discussed with the design of KLEIN [22] and in the design of LED we have aimed at very compact hardware implementation while maintaining some softwarefriendly features.”
MethodMidori: A Block Cipher for Low Energy
Banik, S., Bogdanov, A., Isobe, T., Shibutani, K., Hiwatari, H., Akishita, T., & Regazzoni, F. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48800-3_17 · Cited by 470
“Moreover, in order to avoid having the unfavorable independent property exploited in the full-round attack on KLEIN [24], we add properly-chosen bit-permutations to the begin and the end of 8-bit S-boxes as shown in Fig.”
BackgroundA roadmap for security challenges in the Internet of Things
Riahi Sfar, A., Natalizio, E., Challal, Y., & Chtourou, Z. (2018) · Digital Communications and Networks · doi:10.1016/j.dcan.2017.04.003 · Cited by 480
“…led to plenty number block ciphers primitives for IoT, including mCRYPTON [36], HIGHT [37], SEA [38], DESXL [39], CLEFIA [40], PRESENT [41], KATAN, KTANTAN [42], PRINT Cipher [43], TEA/XTEA [43], Kasumi [44], LED [45], CLEFIA [40], KLEIN [46], Piccolo [47], LBlock [48], Simon and Speck [49], etc.”
Thakor, V. A., Razzaque, M. A., & Khandaker, M. R. A. (2021) · IEEE Access · doi:10.1109/access.2021.3052867 · Cited by 424
“Klein [74] works on 64-bit input using 64-bit, 80-bit and 96-bit keys through 12 (1220 GE), 16 (1478 GE), and 20 (1528 GE) iterations, respectively.”
Metadata
- Authors
- Gong, Z., Nikova, S., & Law, Y. W.
- Affiliations
- South China Normal University (CN)
- The University of Melbourne (AU)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2012
- Pages
- 1-18
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1904699185
- Cited by
- 405
- References
- 53
- Citations by year
- 2026: 10 · 2025: 14 · 2024: 23 · 2023: 26 · 2022: 30 · 2021: 33 · 2020: 31 · 2019: 27 · 2018: 21 · 2017: 30 · 2016: 26 · 2015: 44 · 2014: 40 · 2013: 23 · 2012: 22
- FWCI
- 31.65
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- University of Twente Research Information (submittedVersion)
- Adelaide Research & Scholarship (AR&S) (University of Adelaide) (submittedVersion)
- 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 › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- Klein, lightweight block cipher, resource-constrained devices, RFID tags, wireless sensor networks, embedded cryptography, software performance, hardware implementation
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: KLEIN: A New Family of Lightweight Block Ciphers. https://app.cochat.ai/papers/10.1007/978-3-642-25286-0_1
- The paper
- Gong, Z., Nikova, S., & Law, Y. W. (2012). KLEIN: A New Family of Lightweight Block Ciphers. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-25286-0_1
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.