Serpent

Serpent is a 128-bit block cipher designed by Ross Anderson, Eli Biham and Lars Knudsen as a candidate for the Advanced Encryption Standard. It was a finalist in the AES competition. The winner, Rijndael, got 86 votes at the last AES conference while Serpent got 59 votes, Twofish 31 votes, RC6 23 votes and MARS 13 votes. So NIST’s choice of Rijndael as the AES was not surprising, and we had to content ourselves with silver in the `encryption olympics’. Serpent and Rijndael are somewhat similar; the main difference is that Rijndael is faster (having fewer rounds) but Serpent is more secure. We designed Serpent to provide users with the highest practical level of assurance that no shortcut attack will be found. To achieve this, we limited ourselves to well understood mechanisms, so that we could rely on the existing experience of block cipher cryptanalysis. We also used twice as many rounds as are sufficient to block all currently known shortcut attacks. We believed this to be prudent practice for a cipher that might have a service life of a century or more. Despite these exacting design constraints, Serpent is much faster than DES. Its design supports a very efficient bitslice implementation, and the fastest version at the time of the competition ran at over 45 Mbit/sec on a 200MHz Pentium (compared with about 15 Mbit/sec for DES).


References in zbMATH (referenced in 49 articles )

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

1 2 3 next

  1. Chen, Xi; Qu, Longjiang; Fu, Shaojing; Li, Chao: The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions (2021)
  2. Zajac, Pavol; Jókay, Matúš: Cryptographic properties of small bijective S-boxes with respect to modular addition (2020)
  3. Aragona, Riccardo; Calderini, Marco; Civino, Roberto; Sala, Massimiliano; Zappatore, Ilaria: Wave-shaped round functions and primitive groups (2019)
  4. Aragona, Riccardo; Meneghetti, Alessio: Type-preserving matrices and security of block ciphers (2019)
  5. Belov, S. A.: An algorithm for finding the minimum degree of a polynomial over a finite field for a function over a vector space depending on the choice of an irreducible polynomial (2019)
  6. Brunetta, Carlo; Calderini, Marco; Sala, Massimiliano: On hidden sums compatible with a given block cipher diffusion layer (2019)
  7. Carlet, Claude; Chen, Xi; Qu, Longjiang: Constructing infinite families of low differential uniformity ((n,m))-functions with (m>n/2) (2019)
  8. Civino, Roberto; Blondeau, Céline; Sala, Massimiliano: Differential attacks: using alternative operations (2019)
  9. Hermelin, Miia; Cho, Joo Yeon; Nyberg, Kaisa: Multidimensional linear cryptanalysis (2019)
  10. Aragona, Riccardo; Calderini, Marco; Tortora, Antonio; Tota, Maria: Primitivity of PRESENT and other lightweight ciphers (2018)
  11. Calderini, Marco: A note on some algebraic trapdoors for block ciphers (2018)
  12. 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)
  13. Blondeau, Céline; Leander, Gregor; Nyberg, Kaisa: Differential-linear cryptanalysis revisited (2017)
  14. Calderini, M.; Sala, M.; Villa, I.: A note on APN permutations in even dimension (2017)
  15. Huang, Zhenyu; Lin, Dongdai: Solving polynomial systems with noise over (\mathbbF_2): revisited (2017)
  16. Aragona, Riccardo; Calderini, Marco; Maccauro, Daniele; Sala, Massimiliano: On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion (2016)
  17. Beierle, Christof: Pen and paper arguments for SIMON and SIMON-like designs (2016)
  18. Beierle, Christof; Kranz, Thorsten; Leander, Gregor: Lightweight multiplication in (\mathrmGF(2^n)) with applications to MDS matrices (2016)
  19. Canteaut, Anne; Duval, Sébastien; Leurent, Gaëtan: Construction of lightweight S-boxes using Feistel and MISTY structures (2016)
  20. Goudarzi, Dahmun; Rivain, Matthieu: On the multiplicative complexity of Boolean functions and bitsliced higher-order masking (2016)

1 2 3 next