article

Empirical evidence concerning AES

Authors:

Peter Hellekalek,

Stefan WegenkittlAuthors Info & Claims

ACM Transactions on Modeling and Computer Simulation (TOMACS), Volume 13, Issue 4

Pages 322 - 333

https://doi.org/10.1145/945511.945515

Published: 01 October 2003 Publication History

Abstract

AES, the Advanced Encryption Standard, is one of the most important algorithms in modern cryptography. Certain randomness properties of AES are of vital importance for its security. At the same time, these properties make AES an interesting candidate for a fast nonlinear random number generator for stochastic simulation. In this article, we address both of these two aspects of AES. We study the performance of AES in a series of statistical tests that are related to cryptographic notions like confusion and diffusion. At the same time, these tests provide empirical evidence for the suitability of AES in stochastic simulation. A substantial part of this article is devoted to the strategy behind our tests and to their relation to other important test statistics like Maurer's Universal Test.

References

[1]

Coron, J. S. and Naccache, D. 1998. An accurate evaluation of Maurer's universal test. In Proceedings of Selected Areas in Cryptography 98. Lecture Notes in Computer Science, vol. 1556. Springer-Verlag, New York, 57--71.]]

Digital Library

[2]

Daemen, J. and Rijmen, V. 2002. The Design of Rijndael. Springer-Verlag, New York.]]

Digital Library

[3]

Knuth, D. 1998. The Art of Computer Programming, Vol. 2, 3rd ed. Addison-Wesley, Reading, Mass.]]

Digital Library

[4]

L'Ecuyer, P. and Hellekalek, P. 1998. Random number generators: Selection criteria and testing. In Random and Quasi-Random Point Sets, P. Hellekalek and G. Larcher, Eds. Lecture Notes in Statistics, vol. 138. Springer-Verlag, New York, 223--266.]]

[5]

L'Ecuyer, P. and Simard, R. 1999. Beware of linear congruential generators with multipliers of the form a = &pm; 2q &pm; 2r. ACM Trans. Mod. Comput. Simul. 25, 3, 367--374.]]

Digital Library

[6]

L'Ecuyer, P. and Simard, R. 2002. TestU01: A Software Library in ANSI C for Empirical Testing of Random Number Generators. Départment d'Informatique et de Recherche Opérationelle, Université de Montréal. Software user's guide.]]

[7]

L'Ecuyer, P., Simard, R., Chen, E. J., and Kelton, W. D. 2002a. An object-oriented random-number package with many long streams and substreams. Oper. Res. 50, 6, 1073--1075.]]

Digital Library

[8]

L'Ecuyer, P., Simard, R., and Wegenkittl, S. 2002b. Sparse serial tests of uniformity for random number generators. SIAM J. Sci. Comput. 24, 2, 652--668.]]

Digital Library

[9]

Leeb, H. and Wegenkittl, S. 1997. Inversive and linear congruential pseudorandom number generators in empirical tests. ACM Trans. Mod. Comput. Simul. 7, 2, 272--286.]]

Digital Library

[10]

Marsaglia, G. 1996. DIEHARD. http://stat.fsu.edu/&tilde;geo/diehard.html.]]

[11]

Matsumoto, M. and Kurita, Y. 1994. Twisted GFSR generators II. ACM Trans. Mod. Comput. Simul. 4, 3, 254--266.]]

Digital Library

[12]

Matsumoto, M. and Nishimura, T. 1998. Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. Mod. Comput. Simul. 8, 1, 3--30.]]

Digital Library

[13]

Maurer, U. 1992. A universal statistical test for random bit generators. J. Crypt. 5, 89--105.]]

Digital Library

[14]

Menezes, A. J., van Oorschot, P. C., and Vanstone, S. 1997. Handbook of Applied Cryptography. CRC Press, Boca Raton.]]

Digital Library

[15]

NIST 2001b. A Statistical Test Suite for the Validation of Random Number Generators and Pseudo Random Number Generators for Cryptographic Applications. NIST, National Institute of Standards and Technology. Available from http://csrc.nist.gov/rng.]]

[16]

Pincus, S. and Singer, B. H. 1998a. Randomness and degrees of irregularity. Proc. Natl. Acad. Sci. USA 93, 2083--2088.]]

[17]

Pincus, S. and Singer, B. H. 1998b. A recipe for randomness. Proc. Natl. Acad. Sci. USA 95, 10367--10372.]]

[18]

Shannon, C. E. 1949. Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 657--715.]]

[19]

Spencer, M. E. and Travares, S. E. 1984. A layered broadcast cryptographic system. In Proceedings of CRYPTO83, D. Chaum, Ed. Plenum Press, New York, 157--170.]]

[20]

Wegenkittl, S. 1999. Monkeys, gambling, and return times: Assessing pseudorandomness. In Proceedings of the 1999 Winter Simulation Conference, P. Farrington, H. Nembhard, D. Sturrock, and G. Evans, Eds. IEEE Press, Piscataway, N.J., 625--631.]]

Digital Library

[21]

Wegenkittl, S. 2001a. Entropy estimators and serial tests for ergodic chains. IEEE Trans. Inf. Theory 47, 6 (Sept.), 2480--2489.]]

Digital Library

[22]

Wegenkittl, S. 2001b. Gambling tests for pseudorandom number generators. Math. Comput. Simul. 55, 1--3, 281--288.]]

Digital Library

[23]

Wegenkittl, S. 2002. A generalized φ-divergence for asymptotically multivariate normal models. J. Multiva. Anal. 83, 288--302.]]

[24]

Wegenkittl, S. and Matsumoto, M. 1999. Getting rid of correlations among pseudorandom numbers: Discarding versus tempering. ACM Trans. Mod. Comput. Simul. 9, 3, 282--294.]]

Digital Library

Cited By

Ding ZHe DQiao QLi XGao YChan SChoo K(2024)A Lightweight and Secure Communication Protocol for the IoT EnvironmentIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.326797921:3(1050-1067)Online publication date: May-2024
https://doi.org/10.1109/TDSC.2023.3267979
Rizi MZidaric NBatina LMentens N(2024)Optimised AES with RISC-V Vector Extensions2024 27th International Symposium on Design & Diagnostics of Electronic Circuits & Systems (DDECS)10.1109/DDECS60919.2024.10508919(57-60)Online publication date: 3-Apr-2024
https://doi.org/10.1109/DDECS60919.2024.10508919
Cohen AD’Oliveira RDuffy KWoo JMedard M(2023)AES as Error Correction: Cryptosystems for Reliable CommunicationIEEE Communications Letters10.1109/LCOMM.2023.328540427:8(1964-1968)Online publication date: Aug-2023
https://doi.org/10.1109/LCOMM.2023.3285404
Show More Cited By

Index Terms

Empirical evidence concerning AES

Recommendations

Related-key rectangle attacks on reduced AES-192 and AES-256
FSE'07: Proceedings of the 14th international conference on Fast Software Encryption

This paper examines the security of AES-192 and AES-256 against a related-key rectangle attack. We find the following new attacks: 8-round reduced AES-192 with 2 related keys, 10-round reduced AES-192 with 64 or 256 related keys and 9-round reduced AES-...
Biclique Cryptanalysis of Full Round AES-128 Based Hashing Modes
Inscrypt 2015: Revised Selected Papers of the 11th International Conference on Information Security and Cryptology - Volume 9589

In this work, we revisit the security analysis of hashing modes instantiated with AES-128. We use biclique cryptanalysis as the basis for our evaluation. In Asiacrypt'11, Bogdanov et al. had proposed biclique technique for key recovery attacks on full ...
Biclique cryptanalysis of the full AES
ASIACRYPT'11: Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Since Rijndael was chosen as the Advanced Encryption Standard (AES), improving upon 7-round attacks on the 128-bit key variant (out of 10 rounds) or upon 8-round attacks on the 192/256-bit key variants (out of 12/14 rounds) has been one of the most ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Modeling and Computer Simulation

ACM Transactions on Modeling and Computer Simulation Volume 13, Issue 4

October 2003

84 pages

ISSN:1049-3301

EISSN:1558-1195

DOI:10.1145/945511

Issue’s Table of Contents

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2003

Published in TOMACS Volume 13, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
1,498
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)3

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ding ZHe DQiao QLi XGao YChan SChoo K(2024)A Lightweight and Secure Communication Protocol for the IoT EnvironmentIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.326797921:3(1050-1067)Online publication date: May-2024
https://doi.org/10.1109/TDSC.2023.3267979
Rizi MZidaric NBatina LMentens N(2024)Optimised AES with RISC-V Vector Extensions2024 27th International Symposium on Design & Diagnostics of Electronic Circuits & Systems (DDECS)10.1109/DDECS60919.2024.10508919(57-60)Online publication date: 3-Apr-2024
https://doi.org/10.1109/DDECS60919.2024.10508919
Cohen AD’Oliveira RDuffy KWoo JMedard M(2023)AES as Error Correction: Cryptosystems for Reliable CommunicationIEEE Communications Letters10.1109/LCOMM.2023.328540427:8(1964-1968)Online publication date: Aug-2023
https://doi.org/10.1109/LCOMM.2023.3285404
Almaraz Luengo E(2023)Statistical tests suites analysis methods. Cryptographic recommendationsCryptologia10.1080/01611194.2022.215509348:3(219-251)Online publication date: 30-Jan-2023
https://doi.org/10.1080/01611194.2022.2155093
Swann RStine J(2023)Evaluation of a Modular Approach to AES Hardware Architecture and OptimizationJournal of Signal Processing Systems10.1007/s11265-022-01832-w95:7(797-813)Online publication date: 28-Feb-2023
https://dl.acm.org/doi/10.1007/s11265-022-01832-w
Richardson J(2022)Pseudo-random number generation based on digit isolation referenced to entropy buffersSimulation10.1177/0037549721105446298:5(389-406)Online publication date: 1-May-2022
https://dl.acm.org/doi/10.1177/00375497211054462
Cohen AD’Oliveira RDuffy KMédard M(2022)Partial Encryption after Encoding for Security and Reliability in Data Systems2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834772(1779-1784)Online publication date: 26-Jun-2022
https://dl.acm.org/doi/10.1109/ISIT50566.2022.9834772
Almaraz Luengo ELeiva Cerna MGarcía Villalba LHernandez-Castro J(2022)A new approach to analyze the independence of statistical tests of randomnessApplied Mathematics and Computation10.1016/j.amc.2022.127116426:COnline publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1016/j.amc.2022.127116
L'Ecuyer PNadeau-Chamard OChen YLebar J(2021)Multiple streams with recurrence-based, counter-based, and splittable random number generatorsProceedings of the Winter Simulation Conference10.5555/3522802.3522883(1-16)Online publication date: 13-Dec-2021
https://dl.acm.org/doi/10.5555/3522802.3522883
L'Ecuyer PNadeau-Chamard OChen YLebar J(2021)Multiple Streams with Recurrence-Based, Counter-Based, and Splittable Random Number Generators2021 Winter Simulation Conference (WSC)10.1109/WSC52266.2021.9715397(1-16)Online publication date: 12-Dec-2021
https://doi.org/10.1109/WSC52266.2021.9715397
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents