Efficiency Testing of ANSI C Implementations of Round1 Candidate Algorithms for the Advanced Encryption Standard

Published

October 1, 1999

Author(s)

Lawrence E. Bassham

Abstract

The evaluation criteria for the Advanced Encryption Standard (AES) Round1 candidate algorithms, as specified in the Request for Comments (1), includes computional efficiency, among other criteria. Specifically, the Call For AES Candidate Algorithms (2) required both Reference ANSI¹ C code and Optimized ANSI C code, as well as Java^TM2 code. Additionally, a reference hardware and software platform was specified for testing. NIST performed testingon this reference platform, as well as several others. Candidate algorithms were tested for computational efficiency using the Optimized ANSI C source code provided by the submitters.This paper describes the testing methodology used in ANSI C efficiency testing along with observations regarding the resulting measurements. Conclusions are provided regarding which algorithms have the most consistent performance across different platforms. This paper also includes an appendix containing tables of timing and cycle counting values obtained from testingthe algorithms. Some knowledge regarding compilation and processor architectures is useful in understanding how the data was derived. However, the raw data in the document can also be useful without necessarily understanding how it was derived.

Citation

- 6391

Report Number

6391

Pub Type

NIST Pubs

Keywords

advanced encryption standard, ANSI C, cycle count, efficiency, performance, round1, timing

Citation

Bassham, L. (1999), Efficiency Testing of ANSI C Implementations of Round1 Candidate Algorithms for the Advanced Encryption Standard, - 6391, National Institute of Standards and Technology, Gaithersburg, MD (Accessed December 7, 2024)