The DOI matches its Crossref record; 37 of the 38 references it cites were found in a registry or an index.
PRESENT: An Ultra-Lightweight Block Cipher
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
“One of the promising alternatives of AES for lightweight encryption is PRESENT [104], which uses either an 80or 128-bit encryption key.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [104]
In the citing paper
“PRESENT generally has 32 rounds with key-operation, S-box and P-box layers in each round.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [104]
In the citing paper
“It operates on a block of 64 bits and employs SPN (substitution-permutation network) for encrypted output.”
From Zero Trust Architecture (ZTA): A Comprehensive Survey (2022) · cites this paper as [104]
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748 · cited 1×
“Differential [3] and linear [32] cryptanalysis are among the most powerful techniques available to the cryptanalyst.”
BackgroundDaemen, J., & Rijmen, V. (2002) · Information Security and Cryptography · doi:10.1007/978-3-662-04722-4 · Cited by 2,437
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Differential Cryptanalysis of the Data Encryption Standard
Biham, E., & Shamir, A. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9314-6 · Cited by 1,054
Rivest, R. L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_7 · Cited by 892
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Courtois, N., Klimov, A., Patarin, J., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_27 · Cited by 753
Daemen, J., Knudsen, L. R., & Rijmen, V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052343 · Cited by 741
Self-citation
Research works printed but not linked: 1
- Leander, G., Paar, C., Poschmann, A., Schramm, K.: A Family of Lightweight Block Ciphers Based on DES Suited for RFID Applications. In: Biryukov, A. (ed.) Proceedings of FSE 2007. LNCS, Springer, Heidelberg (2007) (to appear)
Cited by
The Internet of Things vision: Key features, applications and open issues
Borgia, E. (2014) · Computer Communications · doi:10.1016/j.comcom.2014.09.008 · Cited by 1,471
A Comprehensive Study of Security of Internet-of-Things
Mosenia, A., & Jha, N. K. (2017) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2016.2606384 · Cited by 806
Guo, 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
Self-citationPRINCE – 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
Self-citationThe SIMON and SPECK lightweight block ciphers
Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., & Wingers, L. (2015) · Proceedings of the 52nd Annual Design Automation Conference · doi:10.1145/2744769.2747946 · Cited by 728
Metadata
- Authors
- Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C.
- Affiliations
- Ruhr University Bochum (DE)
- Technical University of Denmark (DK)
- Orange (France) (FR)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-22
- Pages
- 450-466
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1894646615
- Semantic Scholar
- dc3ba64b571aa5162bcab61a92c6596eadae69d5
- Cited by
- 2,867
- References
- 38
- Citations by year
- 2026: 120 · 2025: 148 · 2024: 163 · 2023: 191 · 2022: 206 · 2021: 238 · 2020: 223 · 2019: 195 · 2018: 181 · 2017: 209 · 2016: 186 · 2015: 183 · 2014: 136 · 2013: 130 · 2012: 135
- FWCI
- 31.18
- 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 › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- PRESENT block cipher, constrained environments, RFID tags, sensor networks, hardware efficiency, low-power cryptography
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: PRESENT: An Ultra-Lightweight Block Cipher. https://app.cochat.ai/papers/10.1007/978-3-540-74735-2_31
- The paper
- Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007). PRESENT: An Ultra-Lightweight Block Cipher. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-74735-2_31
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.