The Simon and Speck Block Ciphers on AVR 8-Bit Microcontrollers. The last several years have witnessed a surge of activity in lightweight cryptographic design. Many lightweight block ciphers have been proposed, targeted mostly at hardware applications. Typically software performance has not been a priority, and consequently software performance for many of these algorithms is unexceptional. Simon and Speck are lightweight block cipher families developed by the U.S. National Security Agency for high performance in constrained hardware and software environments. In this paper, we discuss software performance and demonstrate how to achieve high performance implementations of Simon and Speck on the AVR family of 8-bit microcontrollers. Both ciphers compare favorably to other lightweight block ciphers on this platform. Indeed, Speck seems to have better overall performance than any existing block cipher — lightweight or not.

References in zbMATH (referenced in 32 articles )

Showing results 1 to 20 of 32.
Sorted by year (citations)

1 2 next

  1. Ashur, Tomer; Beyne, Tim; Rijmen, Vincent: Revisiting the wrong-key-randomization hypothesis (2020)
  2. Chakraborti, Avik; Iwata, Tetsu; Minematsu, Kazuhiko; Nandi, Mridul: Blockcipher-based authenticated encryption: how small can we go? (2020)
  3. Roh, Dongyoung; Koo, Bonwook; Jung, Younghoon; Jeong, Il Woong; Lee, Dong-Geon; Kwon, Daesung; Kim, Woo-Hwan: Revised version of block cipher CHAM (2020)
  4. Zhao, Boxin; Dong, Xiaoyang; Meier, Willi; Jia, Keting; Wang, Gaoli: Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT (2020)
  5. Gohr, Aron: Improving attacks on round-reduced Speck32/64 using deep learning (2019)
  6. Sadeghi, Sadegh; Bagheri, Nasour: Security analysis of SIMECK block cipher against related-key impossible differential (2019)
  7. Alsalami, Yousuf: Constructions with high algebraic degree of differentially 4-uniform ((n, n - 1))-functions and differentially 8-uniform ((n, n - 2))-functions (2018)
  8. Abdelkhalek, Ahmed; Tolba, Mohamed; Youssef, Amr M.: Impossible differential attack on reduced round SPARX-64/128 (2017)
  9. Banik, Subhadeep; Pandey, Sumit Kumar; Peyrin, Thomas; Sasaki, Yu; Sim, Siang Meng; Todo, Yosuke: GIFT: a small present. Towards reaching the limit of lightweight encryption (2017)
  10. Jean, Jérémy; Moradi, Amir; Peyrin, Thomas; Sasdrich, Pascal: Bit-sliding: a generic technique for bit-serial implementations of SPN-based primitives. Applications to AES, PRESENT and SKINNY (2017)
  11. Zajac, Pavol: Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (2017)
  12. Albrecht, Martin; Grassi, Lorenzo; Rechberger, Christian; Roy, Arnab; Tiessen, Tyge: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity (2016)
  13. Ashur, Tomer; Rijmen, Vincent: On linear hulls and trails (2016)
  14. Banik, Subhadeep; Bogdanov, Andrey; Regazzoni, Francesco: Atomic-AES: a compact implementation of the AES encryption/decryption core (2016)
  15. Banik, Subhadeep; Bogdanov, Andrey; Regazzoni, Francesco: Exploring energy efficiency of lightweight block ciphers (2016)
  16. Beierle, Christof: Pen and paper arguments for SIMON and SIMON-like designs (2016)
  17. Beierle, Christof; Jean, Jérémy; Kölbl, Stefan; Leander, Gregor; Moradi, Amir; Peyrin, Thomas; Sasaki, Yu; Sasdrich, Pascal; Sim, Siang Meng: The (\mathttSKINNY) family of block ciphers and its low-latency variant (\mathttMANTIS) (2016)
  18. Biryukov, Alex; Dinu, Daniel; Großschädl, Johann: Correlation power analysis of lightweight block ciphers: from theory to practice (2016)
  19. Chen, Cong; Farmani, Mohammad; Eisenbarth, Thomas: A tale of two shares: why two-share threshold implementation seems worthwhile -- and why it Is not (2016)
  20. Derbez, Patrick; Fouque, Pierre-Alain: Automatic search of meet-in-the-middle and impossible differential attacks (2016)

1 2 next