The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Report on the development of the Advanced Encryption Standard (AES)
Open accessAbstract
In 1997, the National Institute of Standards and Technology (NIST) initiated a process to select a symmetric-key encryption algorithm to be used to protect sensitive (unclassified) Federal information in furtherance of NIST's statutory responsibilities. In 1998, NIST announced the acceptance of 15 candidate algorithms and requested the assistance of the cryptographic research community in analyzing the candidates. This analysis included an initial examination of the security and efficiency characteristics for each algorithm. NIST reviewed the results of this preliminary research and selected MARS, RC™, Rijndael, Serpent and Twofish as finalists. Having reviewed further public analysis of the finalists, NIST has decided to propose Rijndael as the Advanced Encryption Standard (AES). The research results and rationale for this selection are documented in this report.
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
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617
Self-citationLinear 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
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Self-citationDifferential 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
Wagner, D. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48519-8_12 · Cited by 576
Improved Cryptanalysis of Rijndael
Ferguson, N., Kelsey, J., Lucks, S., Schneier, B., Stay, M., Wagner, D., & Whiting, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_15 · Cited by 449
Serpent: A Proposal for the Advanced Encryption Standard
Anderson, R., Biham, E., & Knudsen, L. R. (1998) · Cited by 395
Twofish : A 128-bit block cipher
Schneier, B. (1998) · Cited by 325
Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent
Kelsey, J. M., Kohno, T., & Schneier, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_6 · Cited by 224
MARS - a candidate cipher for AES
Burwick, C., Coppersmith, D., D’Avignon, E., Gennaro, R., Halevi, S., Jutla, C. S., Matyas, S. M., O’Connor, L., Peyravian, M., Safford, D. R., et al. (1999) · Cited by 173
Comparison of the Hardware Performance of the AES Candidates Using Reconfigurable Hardware.
Gaj, K., & Chodowiec, P. (2000) · Cited by 142
(2000) · Cited by 139
Randomness Testing of the Advanced Encryption Standard Finalist Candidates
Soto, J., & Bassham, L. (2000) · Cited by 89
Self-citationPerformance Comparison of the AES Submissions
Schneier, B., Kelsey, J. M., Whiting, D., Wagner, D. A., Hall, C., & Ferguson, N. (1999) · Cited by 81
Attacking Seven Rounds of Rijndael under 192-bit and 256-bit Keys
Lucks, S. (2000) · Cited by 80
Correlations in RC6 with a Reduced Number of Rounds
Knudsen, L. R., & Meier, W. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_7 · Cited by 53
Bitslice Ciphers and Power Analysis Attacks
Daemen, J., Peeters, M., & Assche, G. V. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_10 · Cited by 28
Efficient Methods for Generating MARS-Like S-Boxes
Burnett, L., Carter, G., Dawson, E., & Millan, W. L. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_21 · Cited by 26
Anderson, R., Biham, E., & Knudsen, L. R. (2000) · Cited by 23
Murphy, S. P. (2000) · Cited by 21
Answer to “new observations on Rijndael”
Daemen, J., & Rijmen, V. (2000) · Cited by 5
Cryptanalytic Progress: Lessons for AES
Kelsey, J. M., Ferguson, N., Schneier, B., & Stay, M. (2000) · Cited by 1
Cited by
Advanced Encryption Standard (AES)
National Institute of Standards and Technology (US) (2001) · doi:10.6028/nist.fips.197 · Cited by 642
The Salsa20 Family of Stream Ciphers
Bernstein, D. J. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_8 · Cited by 429
Cache-Collision Timing Attacks Against AES
Bonneau, J., & Mironov, I. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_16 · Cited by 367
Design of integrated multimedia compression and encryption systems
Wu, C.-P., & Kuo, C.-C. J. (2005) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2005.854469 · Cited by 341
Survey and benchmark of block ciphers for wireless sensor networks
Law, Y. W., Doumen, J., & Hartel, P. (2006) · ACM Transactions on Sensor Networks · doi:10.1145/1138127.1138130 · Cited by 290
Metadata
- Authors
- Nechvatal, J., Barker, E., Bassham, L., Burr, W., Dworkin, M., Foti, J., & Roback, E.
- Venue
- Journal of Research of the National Institute of Standards and Technology
- Published
- 2001-05
- Volume
- 106
- Issue
- 3
- Pages
- 511
- ISSN
- 1044-677X (ISSN-L)
- OpenAlex
- W2105225880
- Cited by
- 475
- References
- 22
- FWCI
- 18.40
- Type
- journal article
- Language
- en
- Open access
- bronze
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.