XBX: eXternal Benchmarking eXtension for the SUPERCOP Crypto Benchmarking Framework

  • Christian Wenzel-Benner
  • Jens Gräf
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6225)


SUPERCOP [1] is a benchmarking framework for cryptographic algorithms like ciphers and hash functions. It automatically benchmarks algorithms across several implementations, compilers, compiler options and input data lengths. Since it is freely available for download the results are easily reproducible and benchmark results for virtually every computer that is capable of running SUPERCOP are available. However, since SUPERCOP is a collection of scripts for the Bourne Again Shell and depends on some command line tools from the POSIX standard in it’s current form it can not run on any hardware that does not support POSIX. This is a significant limitation since small devices like mobile phones, PDAs and Smart Cards are important target platforms for cryptographic algorithms. The work presented in this paper extends the SUPERCOP concepts to facilitate benchmarking external targets. A combination of hard- and software allows for cross compilation with SUPERCOP and execution/timing of the generated code on virtually any kind of device large enough to hold the object code of the algorithm benchmarked plus some space for communication routines and a bootloader.


SUPERCOP XBX benchmarking microcontroller small device 8-bit hash function 


  1. 1.
    Bernstein, D.J., Lange, T. (eds.): eBACS: ECRYPT Benchmarking of Cryptographic Systems, (accessed November 5, 2009)
  2. 2.
    NIST: First SHA-3 Candidate Conference, (accessed February 27, 2010)
  3. 3.
    Bernstein, D.J.: Cache-timing attacks on AES, (accessed February 27, 2010)
  4. 4.
    Ideguchi, K., Owada, T., Yoshida, H.: A Study on RAM Requirements of Various SHA-3 Candidates on Low-cost 8-bit CPUs, (accessed February 27, 2010)
  5. 5.
    Otte, D., et al.: AVR Crypto Lib., (accessed February 27, 2010)
  6. 6.
    Radig, U.: AVR Webserver Software, (accessed February 27, 2010)
  7. 7.
    Pollin: AVR-Net-IO Board, (accessed February 28, 2010)
  8. 8.
    Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare, M., Kohno, T., Callas, J., Walker, J.: The Skein Hash Function Family Submission to NIST, Round 2 (2009)Google Scholar
  9. 9.
    Gligoroski, D., Klima, V., Knapskog, S.J., El-Hadedy, M., Amundsen, J., Mjølsnes, S.F.: Cryptographic Hash Function BLUE MIDNIGHT WISH Submission to NIST, Round 2 (2009)Google Scholar
  10. 10.
    Bresson, E., Canteaut, A., Chevallier-Mames, B., Clavier, C., Fuhr, T., Gouget, A., Icart, T., Misarsky, J.-F., Naya-Plasencia, M., Paillier, P., Pornin, T., Reinhard, J.-R., Thuillet, C., Videau, M.: - Shabal, a Submission to NIST’s Cryptographic Hash Algorithm Competition Submission to NIST (2008)Google Scholar
  11. 11.
    Aumasson, J.-P., Henzen, L., Meier, W., Phan, R.C.-W.: SHA-3 proposal BLAKE Submission to NIST (2008)Google Scholar
  12. 12.
    Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak specifications Submission to NIST, Round 2 (2009)Google Scholar
  13. 13.
    Bernstein, D.J.: CubeHash specification (2.B.1) Submission to NIST, Round 2 (2009)Google Scholar
  14. 14.
    ARM: Whitepaper about the Cortex-M3, (accessed February 28, 2010)
  15. 15.
    Intel: Presskit on Moore’s law, (accessed February 28, 2010)
  16. 16.
    Intel: Pentium 3 datasheet, (accessed February 28, 2010)
  17. 17.
    Bernstein, D.J., Lange, T. (eds.): SUPERCOP benchmarking results. See results for computer ’manneke’, (accessed February 27, 2010)

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christian Wenzel-Benner
    • 1
  • Jens Gräf
    • 2
  1. 1.ITK Engineering AGMarburgGermany
  2. 2.LiNetCo GmbHDillenburgGermany

Personalised recommendations