Cryptology ePrint Archive: Report 2009/038

On Algebraic Relations of Serpent S-Boxes

Bhupendra Singh and Lexy Alexander and Sanjay Burman

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.

Category / Keywords: secret-key cryptography /

Publication Info: Not published elsewhere

Date: received 21 Jan 2009, last revised 24 Jan 2009

Contact author: scientistbsingh at gmail com

Available format(s): PDF | BibTeX Citation

Note: We find that there is some discrepancy between the properties of the actual S-boxes of Serpent and the claims of the designers. It is surprising that this has not been pointed out by any body so long. This leads the revisiting the Security of the serpent.

Version: 20090125:052652 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]