PRESENT: An Ultra-Lightweight Block Cipher
The DOI matches its Crossref record; 37 of the 38 references it cites were found in a registry or an index.
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 · cited 3×
“present is an example of an SP-network [33] and consists of 31 rounds.”
BackgroundLinear 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 · cited 2×
“Structural attacks such as integral attacks [25] and bottleneck attacks [17] are wellsuited to the analysis of AES-like ciphers [12, 13, 38].”
BackgroundMethodIntroduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069 · cited 1×
“For instance, while there is a rich theory under-pinning the use of linear feedback shift registers [29] it is not easy to combine these building blocks to give a secure proposal.”
BackgroundDifferential 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 · cited 1×
“Differential [3] and linear [32] cryptanalysis are among the most powerful techniques available to the cryptanalyst.”
BackgroundRivest, 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 · cited 1×
“Some specialised techniques such as XL [10] and XSL [11] have been proposed, though flaws in both techniques have been discovered [8, 14].”
MethodDaemen, J., Knudsen, L. R., & Rijmen, V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052343 · Cited by 741 · cited 1×
“Structural attacks such as integral attacks [25] and bottleneck attacks [17] are wellsuited to the analysis of AES-like ciphers [12, 13, 38].”
BackgroundSelf-citationStrong Authentication for RFID Systems Using the AES Algorithm
Feldhofer, M., Dominikus, S., & Wolkerstorfer, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_26 · Cited by 715 · cited 2×
“For modern block ciphers, the landmark paper of [16] gives a very thorough analysis of a low-cost implementation of the AES [35].”
BackgroundHIGHT: 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 1×
“Implementation requirements for the Tiny Encryption Algorithm tea [43,44] are not known, but a crude estimate is that tea needs at least 2100 GE and xtea needs 2 at least 2000 GE. Four dedicated proposals for low-cost implementation are mCrypton [30], hight [ 22 ], sea [41], and cgen [40], though the latter is not pri…”
BackgroundCryptanalysis of Block Ciphers with Overdefined Systems of Equations
Courtois, N. T., & Pieprzyk, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_17 · Cited by 688 · cited 2×
“Some specialised techniques such as XL [10] and XSL [11] have been proposed , though flaws in both techniques have been discovered [8, 14].”
MethodGrain: A stream cipher for constrained environments
Hell, M., Johansson, T., & Meier, W. (2007) · International Journal of Wireless and Mobile Computing · doi:10.1504/ijwmc.2007.013798 · Cited by 568 · cited 1×
“While this work is ongoing, some promising candidates are emerging [7, 19 ].”
BackgroundMarkov Ciphers and Differential Cryptanalysis
Lai, X., Massey, J. L., & Murphy, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_2 · Cited by 556
TEA, a tiny encryption algorithm
Wheeler, D. J., & Needham, R. M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_29 · Cited by 556 · cited 1×
“Implementation requirements for the Tiny Encryption Algorithm tea [43, 44] are not known, but a crude estimate is that tea needs at least 2100 GE and xtea needs(5) at least 2000 GE.”
BackgroundNew types of cryptanalytic attacks using related keys
Biham, E. (1994) · Journal of Cryptology · doi:10.1007/bf00203965 · Cited by 473 · cited 1×
“The most effective attacks come under the general heading of related-key attacks [2] and slide attacks [5], and both rely on the build-up of identifiable relationships between different sets of subkeys.”
BackgroundKnudsen, L. R., & Wagner, D. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45661-9_9 · Cited by 460 · cited 1×
“Structural attacks such as integral attacks [25] and bottleneck attacks [17] are wellsuited to the analysis of AES-like ciphers [12, 13, 38].”
BackgroundSelf-citationCamellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., & Tokita, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44983-3_4 · Cited by 447 · cited 1×
“present-80 80 64 32 200 0.18µm 1570 1 AES-128 [16] 128 128 1032 12.4 0.35µm 3400 2.17 HIGHT [22] 128 64 34 188.2 0.25µm 3048 1.65 mCrypton [30] 96 64 13 492.3 0.13µm 2681 1.71 Camellia [ 1 ] 128 128 20 640 0.35µm 11350 7.23 DES [37] 56 64 144 44.4 0.18µm 2309 1.47 DESXL [37] 184 64 144 44.4 0.18µm 2168 1.38”
InfluentialDifferential-Linear Cryptanalysis
Langford, S. K., & Hellman, M. E. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_3 · Cited by 273 · cited 1×
“Among the dedicated attacks we considered was one using palindromic differences, since symmetrical differences are preserved with probability one over the diffusion layer, and some advanced variants of differentiallinear attacks [28].”
MethodmCrypton – A Lightweight Block Cipher for Security of Low-Cost RFID Tags and Sensors
Lim, C. H., & Korkishko, T. (2006) · Lecture Notes in Computer Science · doi:10.1007/11604938_19 · Cited by 259 · cited 1×
“Four dedicated proposals for low-cost implementation are mCrypton [30], hight [22], sea [41], and cgen [40], though the latter is not primarily intended as a block cipher.”
BackgroundSerpent: A New Block Cipher Proposal
Biham, E., Anderson, R., & Knudsen, L. R. (1998) · Lecture notes in computer science · doi:10.1007/3-540-69710-1_15 · Cited by 256 · cited 1×
“In achieving this we have looked back at the pioneering work embodied in the DES [34] and complemented this with features from the AES finalist candidate Serpent [4] which demonstrated excellent performance in hardware.”
MethodSelf-citationBiryukov, A., & Wagner, D. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_41 · Cited by 246 · cited 1×
“The most effective attacks come under the general heading of related-key attacks [2] and slide attacks [5], and both rely on the build-up of identifiable relationships between different sets of subkeys.”
BackgroundOn the Classification of 4 Bit S-Boxes
Leander, G., & Poschmann, A. Y. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-73074-3_13 · Cited by 228 · cited 1×
“Using a classification of all 4-bit S-boxes that fulfill the above conditions [27] we chose an S-box that is particular well-suited to efficient hardware implementation.”
MethodSelf-citationSEA: A Scalable Encryption Algorithm for Small Embedded Applications
Standaert, F.-X., Piret, G., Gershenfeld, N., & Quisquater, J.-J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11733447_16 · Cited by 226 · cited 1×
“Four dedicated proposals for low-cost implementation are mCrypton [30], hight [22], sea [41], and cgen [40], though the latter is not primarily intended as a block cipher.”
BackgroundRijmen, V., Daemen, J., Preneel, B., Bosselaers, A., & Win, E. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_47 · Cited by 211 · cited 1×
“Structural attacks such as integral attacks [25] and bottleneck attacks [17] are wellsuited to the analysis of AES-like ciphers [12, 13, 38].”
BackgroundNew Types of Cryptanalytic Attacks Using Related Keys
Biham, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_34 · Cited by 163
Small Scale Variants of the AES
Cid, C., Murphy, S. P., & Robshaw, M. J. B. (2005) · Lecture notes in computer science · doi:10.1007/11502760_10 · Cited by 147 · cited 1×
“Simulations on small-scale versions of the AES showed that for all but the very smallest SP-networks one quickly encounters difficulties in both time and memory complexity [9].”
MethodSelf-citation(2000) · Cited by 139
Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis
Heys, H. M., & Tavares, S. E. (1996) · Journal of Cryptology · doi:10.1007/bf02254789 · Cited by 100 · cited 1×
“It is therefore not surprising that similar designs have been considered in other contexts [21] and can even be used as a tutorial for students [20].”
BackgroundThe XL-Algorithm and a Conjecture from Commutative Algebra
Diem, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30539-2_23 · Cited by 86 · cited 1×
“Some specialised techniques such as XL [10] and XSL [11] have been proposed, though flaws in both techniques have been discovered [8, 14].”
MethodAn Analysis of the XSL Algorithm
Cid, C., & Leurent, G. (2005) · Lecture notes in computer science · doi:10.1007/11593447_18 · Cited by 79 · cited 1×
“Some specialised techniques such as XL [10] and XSL [11] have been proposed, though flaws in both techniques have been discovered [8, 14].”
MethodImproved Time-Memory Trade-Offs with Multiple Data
Biryukov, A., Mukhopadhyay, S., & Sarkar, P. (2006) · Lecture notes in computer science · doi:10.1007/11693383_8 · Cited by 78 · cited 1×
“The literature contains a range of attacks that manipulate time-memory-data trade-offs [6] or the birthday paradox when encrypting large amounts of data.”
BackgroundTruncated differentials of SAFER
Knudsen, L. R., & Berson, T. A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60865-6_38 · Cited by 54 · cited 1×
“We also established that truncated differential cryptanalysis [23, 24] was likely to have limited value, though the following two-round”
BackgroundSelf-citationTruncated Differentials and Skipjack
Knudsen, L. R., Robshaw, M. J. B., & Wagner, D. A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48405-1_11 · Cited by 50 · cited 1×
“We also established that truncated differential cryptanalysis [23, 24] was likely to have limited value, though the following two-round”
BackgroundSelf-citationSecurity and performance optimization of a new DES data encryption chip
Verbauwhede, I. M. R., Hoornaert, F., Vandewalle, J. P. L., & Man, H. D. (1988) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.302 · Cited by 33
Searching for Compact Algorithms: cgen
Robshaw, M. J. B. (2006) · Lecture notes in computer science · doi:10.1007/11958239_3 · Cited by 28 · cited 1×
“Four dedicated proposals for low-cost implementation are mCrypton [30], hight [22], sea [41], and cgen [40], though the latter is not primarily intended as a block cipher.”
BackgroundSelf-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
“Examples are Scalable Encryption Algorithm (SEA) [239], and PRESENT [240] for symmetric cypher, and the Elliptic Curve Cryptography (ECC) [241] family for asymmetric cypher.”
BackgroundA 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
“PRESENT-128 [11] 128 64 32 200.”
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
“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.”
MethodInfluentialSelf-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
“The smallest implementation of PRESENT-128 we know of requires 117 slices on this FPGA [29].”
BackgroundInfluential
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
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.