International Journal of Scientific & Engineering Research, Volume 5, Issue 4, April-2014 606
ISSN 2229-5518
Design and Verification of AES encryption with new approach for S-Box
Bhupendra Badoniya, Ravi Mohan
Abstract— Information security has become a very critical aspect of modern computing systems. W ith the global acceptance of internet, virtually every computer in the world today is connected to every other. W hile this has created tremendous productivity and unprecedented opportunities in the world we live in, it has also created new risks for the users of these computers [2]. The users, businesses and organizations worldwide have to live with a constant
threat from hackers and attackers, who use a variety of techniques and tools in order to break into computer systems, steal information, change data and cause havoc [2]. The paper work aims at designing and implementing a secure data communication between any two users based on the realization of advanced Symmetric-key Cryptographic algorithm called Advanced Encryption Standard (AES) on an FPGA based processor.
Index Terms— AES (Encryption & Decryption) Algorithm, CPLD (Complex Programmable Logic Design), EDA (Electronic Device Automation), FPGA (Field Programmable Gate Array), ISE (Integrated Simulation Environment), IOB (Input Output Buffer), LUT (Look up table).
—————————— ——————————
Cryptographic technology is an important way to ensure information security, and is the key to information safety. Among all kinds of cryptographic algorithms, Advanced Encryption Standard Algorithm (AES) is preferred as it offers high security, efficiency, convenient usage, flexibility, and comprehensive performance [4].
Fig 1. Encryption process Block Diagram
————————————————
• Ravi Mohan is currently working in Electronics & Communication department in SRIT, Jabalpur RGPV University, India, PH-09406737876.
E-mail: ravimohan7677@yahoo.co.in
The AES algorithm is a symmetric block cipher that can encrypt, (encipher), and decrypt, (decipher), information. Encryption converts data to an unintelligible form called Cipher-text. Decryption of the cipher-text converts the data back into its original form, which is called plaintext. The AES algorithm is capable of using cryptographic keys of
128, 192 and 256 bits to encrypt and decrypt data in the blocks of bits[7]. AES cipher is specified as a number of repetitions of transformation rounds that convert the input plaintext into the final output of ciphertext.
Each round consists of several processing steps, including one that depends on the encryption key. A set of reverse rounds are applied to AES is based on a design principle known as a Substitution permutation network. Unlike its predecessor, DES, AES does not use a Feistel network. AES operates on a 4 x 4 array of bytes called state in a matrix form. The algorithm consists of performing four different simple operations. These operations are: Sub Bytes, Shift Rows, Mix Columns and Add Round Key.
AES operates on a 4x4 array of bytes (referred to as “state”). The algorithm consists of performing 4 different operations[4].
IJSER © 2014 http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 4, April-2014 607
ISSN 2229-5518
TABLE 1
S-BOX: SUBSTITUTION
MixColumns step, each column of the state is multiplied with a fixed polynomial a(x).
In the MixColumns step, the four bytes of each column of the state are combined using an invertible linear transformation. The MixColumns function takes four bytes as input and outputs four bytes, where each input byte affects all four output bytes.
Columns are considered with fixed
Polynomial a(x), given by
Let (2)
(1)
for 0 =c < Nb MixColumns( ) operates on the state column-by-column.
shift(1,4) =1; shift(2,4) = 2 ; shift(3,4) = 3
Fig 2. ShiftRows ( ) cyclically shifts the last three rows in the state.
Round keys are derived from the cipher key using Rijndael's key schedule. The AES algorithm takes the Cipher Key, K, and performs a Key Expansion routine to generate a key schedule. The Key Expansion generates a total of Nb (Nr +
1) words. The expansion of the input key into the key
schedule proceeds as per the functions Rotword(),
Subword(), Rcon[i/Nk], Xor operations[1].
Fig 3. Proposed architecture S8 box
IJSER © 2014 http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 4, April-2014 608
ISSN 2229-5518
Fig 4. Simulation and RTL schematic of proposed work
From the simulation as shown in above slides
Key : A234567ba234a234a234567ba234a234
Result:-1
Output: Cde5017b64cd7e93
Input: A234567ba234a234
Output^Input: 6fd15700c6f9dca7
Avalanche: 41 bit change/64 bit
Result:-2
Output: Df5ab6daed24e9c5
Input: A234a234567ba234
Output^Input: 7d6e14eebb5f4bf1
Avalanche: 45 bit change/64 bit
TABLE 2
RESULTS FOR EACH MODULE
TABLE 3
COMPARATIVE RESULTS
The work is implemented of FPGA which makes proposed
IJSER © 2014 http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 4, April-2014 609
ISSN 2229-5518
work a semicustom design as known semicustom design always lack behinds compare to full-custom design in term of Area, speed and power. In future proposed work can be implemented at transistor level (i.e. Full-custom).
I Bhupendra Badoniya would like to thanks to Prof Ravi
Mohan for their valuable support and timely guidelines.
[1] Dr.R.V.Kshirsagar1, M.V.Vyawahare2, FPGA Implementation of High speed VLSI Architectures for AES Algorithm, 2012 Fifth International Conference on Emerging Trends in Engineering and Technology,
978-0-7695-4884-5/12, 2012 IEEE, DOI
10.1109/ICETET.2012.53
[2] Shylashree.N1, Nagarjun Bhat2 and V. Shridhar3, FPGA
IMPLEMENTATIONS OF ADVANCED ENCRYPTION STANDARD: A SURVEY, International Journal of Advances in Engineering & Technology, May 2012. ISSN: 2231-1963
[3] Mr. Atul M. Borkar, Dr. R. V. Kshirsagar, Mrs. M. V.
Vyawahare, FPGA Implementation of AES Algorithm,
978-1-4244-8679-3/11, 2011 IEEE
[4] Hassen Mestiri, Noura Benhadjyoussef, Mohsen Machhout and Rached Tourki, An FPGA Implementation of the AES with Fault Detection Countermeasure, CoDIT'13,
978-1-4673-5549-0/13/, 2013 IEEE [5] http://www.xilinx.com/support.html
[6] Wisniewski, Remigiusz (2009). Synthesis of compositional
microprogram control units for programmable devices. Zielona Góra: University of Zielona Góra. p. 153. ISBN 978-83-7481-293-1
[7] Thomas Jakobsen and Lars Knudsen. The interpolation attack on block ciphers. In Fast Software Encryption ’97, volume 1267 of LNCS, pages 28–40. Springer-Verlag, 1997.
[8] Eli Biham and Adi Shamir. Differential Cryptanalysis of the Data
Encryption Standard. Springer-Verlag, 1993.
[9] Mitsuru Matsui. Linear cryptanalysis method for DES cipher.
In Advances in Cryptology—Eurocrypt ’93, volume 765 of
LNCS, pages 386–397. Springer-Verlag, 1993.
IJSER © 2014 http://www.ijser.org
International Journal of Scientific & Engineering Research, Volume 5, Issue 4, April-2014
ISSN 2229-5518
610
IJSER lb)2014