Paper 2009/038 Original: eprint.iacr.org/2009/038 ↗
On Algebraic Relations of Serpent S-Boxes
Abstract
Serpent is a 128-bit block cipher designed by Ross Anderson, Eli Biham and Lars Knudsen as a candidate for the Advanced Encryption Standard (AES). It was a finalist in the AES competition. The winner, Rijndael, got 86 votes at the last AES conference while Serpent got 59 votes [1]. The designers of Serpent claim that Serpent is more secure than Rijndael.In this paper we have observed that the nonlinear order of all output bits of serpent S-boxes are not 3 as it is claimed by the designers.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2009-01-25: last updated
- 2009-01-25: published
- Short URL
- https://ia.cr/2009/038
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/038,
author = {Bhupendra Singh and Lexy Alexander and Sanjay Burman},
title = {On Algebraic Relations of Serpent S-Boxes},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/038},
year = {2009},
url = {https://eprint.iacr.org/2009/038}
}