DocumentCode :
3107901
Title :
Random S-Box generation in AES by changing irreducible polynomial
Author :
Das, Indrajit ; Nath, Siddhartha ; Roy, Sandip ; Mondal, Sudipta
Author_Institution :
Dept. of CSE & IT, Meghnad Saha Inst. of Technol., Kolkata, India
fYear :
2012
fDate :
28-29 Dec. 2012
Firstpage :
556
Lastpage :
559
Abstract :
The S-Box and Inverse S-Box in the tradition advance encryption standard is fixed and it is made by the composite field arithmatic to find the multiplicative inverse in the finite field GF (28). But in traditional AES the use of irreducible polynomial m(x) = x8+ x4 + x3 + x+1 to find out multiplicative inverse, is known to the attacker. So if we can make use of different irreducible polynomial every time to the finite field of GF (28) and send this the receiver combined with the secret key, then every time a new irreducible polynomial is used and a random S-Box is generated. Hence, the security of the algorithm is enhanced. In this paper, we devise an algorithm, which make use of different irreducible polynomial to finite field of GF (28) to make random S-Box and Inverse S-Box.
Keywords :
cryptography; polynomials; AES; advance encryption standard; composite field arithmatic; finite field GF; inverse S-box; irreducible polynomial; multiplicative inverse; random S-box generation; secret key; Finite element methods; Galois fields; Polynomials; Receivers; Security; Standards; Finite field; Inverse S- Box Multiplicative Inverse; Irreducible Polynomial; S-Box; Substitute bytes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Devices and Intelligent Systems (CODIS), 2012 International Conference on
Conference_Location :
Kolkata
Print_ISBN :
978-1-4673-4699-3
Type :
conf
DOI :
10.1109/CODIS.2012.6422263
Filename :
6422263
Link To Document :
بازگشت