Software Benchmarking of the 2$^{\text{nd}}$ round CAESAR Candidates

Ralph Ankele; Robin Ankele

Paper 2016/740

Software Benchmarking of the 2$^{\text{nd}}$ round CAESAR Candidates

Ralph Ankele and Robin Ankele

Abstract

The software performance of cryptographic schemes is an important factor in the decision to include such a scheme in real-world protocols like TLS, SSH or IPsec. In this paper, we develop a benchmarking framework to perform software performance measurements on authenticated encryption schemes. In particular, we apply our framework to independently benchmark the 29 remaining 2$^\text{nd}$ round candidates of the CAESAR competition. Many of these candidates have multiple parameter choices, or deploy software optimised versions raising our total number of benchmarked implementations to 232. We illustrate our results in various diagrams and hope that our contribution helps developers to find an appropriate cipher in their selection choice.

Note: Correct grammer and spelling mistakes

Metadata

Available format(s): PDF
Publication info: Preprint.
Keywords: Software benchmarks CAESAR 2$^\text{nd}$ round candidates real-worlds usecases tls ssh optimisations aes-ni sse avx neon
Contact author(s): ralph ankele 2015 @ rhul ac uk
History: 2016-09-05: last of 2 revisions; 2016-07-29: received; See all versions
Short URL: https://ia.cr/2016/740
License: CC BY

BibTeX

@misc{cryptoeprint:2016/740,
      author = {Ralph Ankele and Robin Ankele},
      title = {Software Benchmarking of the 2$^{\text{nd}}$ round {CAESAR} Candidates},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/740},
      year = {2016},
      url = {https://eprint.iacr.org/2016/740}
}