2 Algorithm Description
|
|
- Lizbeth Marshall
- 5 years ago
- Views:
Transcription
1 An implementation of Rinjdael algorithm through programmable logic devices J.E. Muñoz, A.J. Yuste,.J. Sanchez-Roselly, S.G. Galan Departamento de Electrónica Universidad de Jaén Alfonso X El Sabio, Linares (Jaen) SPAIN Abstract: - This paper describes an implementation of the Rijndael(v.2) ciphered algorithm. Hardware implementation uses a programmable logic device (PLD) manufactured by ALTERA. Concretely, it is considered a LEX10K family device. Its main feature is to enclose EAB blocks, useful to bring about the necessary tables for the development of the algorithm. This realization uses a distributed control to chain multiples units with the purpose of increasing the bits rate. Key Words: - Block Cipher. State. Round. Byte Transformation. Key Addition. Distributed Control. 1 Introduction In 1996, NIST started works forward the consolidation of a standard in advanced ciphered (Advanced Encryption Standard, AES). Its objective was the development of a specification to find an cipher algorithm that substitute the current ones, i.e. DES, so that the new algorithm will be capable of protecting the sensitive information of the citizens and of the government over the XXI century. It is hoped that the selected algorithm will be used by the Government of United States and by private sectors, in substitution of DES. It is expected that the rest of the world would adopt it. In October 2000, NIST announced the winning algorithm: Rijndael, the Belgian Vincent Rijmen and Joan Daemen proposed it. Rijndael it is a block cipher algorithm that operates with blocks and keys of different length that can be specified to 128, 192 or 256 bits. The objective of this work is the implementation of the "Rijndael(v.2) ciphered algorithm through a programmable logic device (PLD). Concretely, it has been considered a device of the family LEX10K(Altera). irst, a study of the algorithm and component blocks was carried out in order to implement the cipher and its inverse. It is a symmetrical private key system (based on the utilization of a secret key), so it will be necessary to accomplish a key planning. In order to achieve these proposes, a iterative program will be developed, in every iteration or round, it will generate derived keys from a given initial key (and its inverse). 2 Algorithm Description Rijndael is a block cipher algorithm with flexible block and key length. The possible values are 128,192 and 256 bits. The information to cipher is block decomposed, on these blocks some transformations are applied. Different functions have been programmed for the realization of these transformations: - Bit mixing. It works a linear combination between block bits. - Byte transformation. It is a non-linear value assignment for the different byte combination. - Key addition. It accomplishes a XOR function between block bits and key bits. The result of applying the different transformations on a block is called state. The different states generated can be represented using a byte matrix, each byte matrix has four rows. The number of columns is equal to the length of the block divided by 32, and it is designated as Nb. The number of columns varies according to the length of the block that it is being handled, thus for the different lengths we can select, it exists the following values of Nb:
2 Table I BLOCK LENGHT (NB) NUMBER O COLUMNS (Nb) This discussion also applies for the key, but in this case, the number of columns is named Nk, instead of Nb. An example for Nb=4 (128 bits of block) and Nk=4 (128 bits of key length) is: KeyAdition(state, keyiter) or ( i=1; i<nr; i++) { ByteSub(state); ShiftRow(state); MixColumn(state); KeyAdition(state, keyiter); } ByteSub(state); ShiftRow(state); KeyAdition(state, keyiter); Table II a 0,0 a 0,1 a 0,2 a 0,3 a 1,0 a 1,1 a 1,2 a 1,3 a 2,0 a 2,1 a 2,2 a 2,3 a 3,0 a 3,1 a 3,2 a 3,3 The first step in order to cipher a data block using Rijndael, is to make an initial key addition, performing an XOR operation with operands equal to the data block. Afterward, a series of regular iterations are carried out, and at last, a final iteration is brought out without MixColumn. Table III k 0,0 k 0,1 k 0,2 k 0,3 k 1,0 k 1,1 k 1,2 k 1,3 k 2,0 k 2,1 k 2,2 k 2,3 k 3,0 k 3,1 k 3,2 k 3,3 The text bytes not ciphered correspond with the bytes a i,j of the byte matrix following this order a 0,0, a 1,0, a 2,0, a 3,0, a 0,1, a 1,1, a 2,1, a 3,1, a 0,2., and the key bytes are the corresponding with: k 0,0, k 1,0, k 2,0, k 3,0, k 0,1, k, 1,1, k 2,1, k 3,1, k 0,2 When the process completes, the bytes are extracted in the same order. The number of iterations is named as Nr and it is a function of the block length and the key, that is, it is function of Nb and Nk. or different values of theses variables, we have the following number of iterations: Nr Nb=4 Nb=6 Nb=8 Nk= Nk= Nk= Table IV The implementation, that is being designed, works with a Nb value equal to 4. The blocks are 128 bits sized. The cipher algorithm has the following structure: The functions carried out in the cipher algorithm are: - KeyAdition: it implements the XOR operation between the key and data or state block. The key length is 128 bits, but an appropriate calculation provides a key of bits, 128 bits for the first XOR operation (this operation is performed with the original key) and 128 bits for each iteration. The key expansion is not hardware calculated because it does not frequently change. Before the cipher process, the key is saved into a ROM, and it will be loaded in the beginning of the KeyAdition. - ShiftRow: the four block rows are shifted to the left sequentially 0,1,2 and 3 positions. - ByteSub: All the bytes are altered by a non-linear function. - MixColumn: A linear function is applied to each column of the block. This function is a multiplication with a fixed polynomial on G(28), module x This step is omitted in the concluding iteration. or the inverse cipher, the same algorithm is employed, nevertheless, the weak variations from the direct cipher are specified in the next section. 3 Algorithm Implementation In the project implementation, the cipher algorithm and its inverse were developed. A 128 bits size was selected for both the block and key. The system is
3 MIXCOL E_S SHITROW SEL_SBOX SBOX D[63..0] MIXCOL MUX KEYADITION IRST RESET ENCRYP IN CK UCONTROL M S AKEY[6..0] CELL[3..0] igure 1: Cipher System made up using blocks; each one is associated with a specific function. The most important elements carry out the transformation functions that are applied to the block, these are shift_row, mixcol and key_adition. The general cipher system structure is shown in the igure 1. The elements that constitute the cipher implementation are the following ones: e_s: this block useful for performing the input/output function. This device has a two-way bus of 64 bits, d[63..0]. shift_row: this part implements the ShiftRow(state) function. sel_sbox: it is an intermediate module, that works coupling the input to the sbox block. Its role is to select the two bytes that will be applied simultaneously to the transformation sbox. sbox: this part implements the ByteSub(state) transformation. It is 256 bytes memory saved table. Sbox transforms two bytes concurrently. mixcol: this block function is the accomplishment of the MixColumn(state) transformation. In figure 1, two modules mixcol appear, the reason is the simultaneous application of the transformation on two bytes. first: this part selects the data that will be XOR added in the key_adition block. It selects the data from different sources: e_s block, sbox (in the last iteration) or mixcol (in a regular iteration). key_adition: this block contains the various keys used in the different iterations. It implements XOR operation between the 32 first s bits and their corresponding keys. mux: it is in charge of selecting data source. It chooses if the records that store the block will be loaded from the external data bus, or they are the result of the key_adition function. ucontrol: this part generates the control signals, it sequences the different actions that must be carried out on the blocks to obtain the correct system operation. The block 128 bits will not be loaded at the same time. In order to process the block, a 64 bit subsets are taking. Initially, the 64 bits less meaningful of the block will be loaded and afterwards, the higher 64 bits. 3.1 Control unit This module generates the system control signals. It sequences the actions to accomplish for the execution of the cipher algorithm.
4 f1 cell(3..0 CELL_EQU4_8 RES R(3..0) clr S s cella(3..0 f1 cell(3..0 nac CELL_EQU4_8 RES R(3..0) CELL_EQU5_9 LDL CELL(3..0) NACK LDH ldmix ldl ldh rese encry in ck RESET ENCRYP IN CK M CELL(6..0) 0 AKEY(6.0) 1 m f cella(6..0 f1 D_LATCH akey(6..0 f3 cell(3..0 nac CELL_EQU9 SUMA CELL(3..0) NACK LDSH suma ldsh 2 3 ACK NACK f2 f3 ac nac D_LATCH cell(6..0 igure 2: Control Unit This block generates four phases (, f1, f2, f3) that act as signals to the sequencer. It also originates the signals S, M, used to select the data sources in blocks. Other signals generated by the ucontrol are cella[3..0] and akeya[6..0]. These ones are equal to cell[3..0] and akey[6..0] that are signals that will be presented below. The only one difference between these two groups is a clock cycle out-of-phase each other. The blocks appointed with cell_equ generate the signals clr, ldmix, sum, ldsh. These part also originate the signals ldl and ldh, which are in charge of storing in e_s the new state. The signals grouped as cell[3..0] are used for different end. That is: - cell[2..0] select the two bytes that are going to be transformed into the function sbox, - cell[1..0] act as a coefficient selector, the number generated is multiplied by a mixcol byte and it is also used for directional proposes on the key_adition module reports. - cella2 is entrusted with selecting between 64 bits more meaningful or the 64 lower ones, in the first key_adition block iteration the choose group will be added. In this module, an account of the signal cell[3..0] is carried out, this account is a parameter that will be used to bring about different signals. The following blocks generate these signals: - cell_equ_4_8: when cell[3..0] yields 4 or 8 and the signal f1 equals 1, the sign clr will be activated, this condition will cause the erase of the accumulated value in the mixcol biestables. In a similar way, when cella[3..0] yields 4 or 8 and the sign equals 1, signal ldmix activates, causing the mixcol bytes propagation to the rest of the blocks. - cell_equ_5_9: ldl signal will be turned on when f1=1, cell[3..0]=5 and nack=1. ldh signal will switch on when f1=1, cell[3..0]=9 and nack=1. - cell_equ_9: when half of the rising up of cella[3..0] signal occurs adds signal will be generated. When that account is halved, the data in mixcol is already found at the entry of the biestable. adds signal is equal to f3 as long as cell[3..0] will be different from 8 and 9, in whose case this signal will yield zero. ldsh signal will be activated under the following condition: cell[3..0]=9, f3=1 and nack=1. This signal originates a change towards a new state. We have designed the system for to reach 9 counts, due to the fact that data will not be processed on 8 cycles cell[3..0] signal. akey[6 0] signal will be used to carry the cycles account needed in the cipher process, and depending on this account value the group of signals, M or S will activate. The generation of akey[6..0] signal is not coupled, that is, these signs appear toward the end of the phase f1, but they are not used below. They are stored in a record and they will act in the following phase,. In this way, when a phase began using a given group of akey signals, simultaneously, the generation of the
5 following group of signals is carried out. This fact causes an overlapping that improves the yield of the system: with the beginning of a new phase, the states machine evolved, it is generated a new future combination of akey and cell, and meanwhile the data go evolving by the system. 3.3 Mixcol This block is in charge of the implementation of MixColumn(state) function. This transformation consists on multiplication operation on each of the bytes of a column by a coefficient and afterwards, an XOR sum is performed between the said product results. All these operations turned out a new byte. The mixcol block implements the MixColumn(state) function as long as the entry signal M equals 1. In the opposite case, the signal S is the one that equals 1, and the mixcol block will successively load bytes that are going to generate sbox in the corresponding bi bytes records taking into account the transformation. This is due to the fact that in the last iteration of the algorithm, it is not necessary to make the said transformation. This transformation arises from the following counterfoil: igure 3: Control Unit Signals Simulation 3.2 key_adition The main function of this block is to store the key generated when iteration occurs. The implemented device does not calculate a key. Working on given key, new keys are derived; the information accomplished is internally saved. This data is saved as a 32 bits broad of band report. The reasons to chose this implementation strategy are: - Integration space. It is cheaper to implement a table than a calculation key hardware. On the other hand, this calculation was demoting the algorithm speed, unless a high degree of parallelism is used. - Security. The fact of using an encapsulated key gives rise to a secure robust device. If the key were introduced from the foreign, it would be vulnerable because the foreign will access the data bus. This information is added to the one that comes of first and the result enters the module mux, being at the point e_s, where it will be stored and later, it will cause a new block or state. b b b b = a0 a1 03 a 2 02 a3 The bytes transformed by sbox block enter this function. Each iteration produced in sbox generates 4 new bytes from a 4 bytes entry. Those new 4 bytes are mixcol part result. The remarkable features of the refereed counterfoil are the following: when the first byte, a0, gets in, it is multiplied by '02' and stored in the intended record for b0 harbor. In parallel way, a0 is multiplied by '' and saved in the internal record used to build b1. On the same way, it will be multiplied by '' to be stored in the record to be later used by b2, the result of multiplying operation by '03' will be saved in the internal record for b3 use. When the second byte, a1 arrives, it will be multiplied by '03' and the turned out result will be XORed with the value stored in b0, this value will be stored in b0. At the same time, it will be multiplied by '03', '' and '', and the same process will be accomplished. The hole can be resumed as follows, when the following bytes arrive, they are multiplied by the coefficient that corresponds and are saved in their exit records, making a XOR with the value previously stored. When the four bytes have arrived, the bytes b0 to b3 are not yet created.
6 This block is more complex one implemented in the system. While the sbox bytes are obtained, they are pushed into the mixcol modules. Each time a 4 bytes goup originated in sbox enter to each Mixcol module, 4 new bytes are generated, constituting the output of Mixcol part. As two mixcol blocks forms the system structure, during each 4 clock cycles, 8 bytes will be processed (4 bytes of each Mixcol), so it will take 8 clock cycles to transform the 16 bytes that constitute a complete block. 4 Results or a 128 block and key length, that have been treated in the project, and with a clock of 12 nseg (83.3 MHz), it takes only 5.3 microseg, giving bit rate of 24.2 Mbps. or inverse, the bits rate obtained is 20.8 Mbps. It is a strong algorithm, difficult to break. The keys are saved into the device, there is no external access to them. This fact guarantees the system safety. If the cipher process is built using a software implementation, the key will be placed in memory or in a secondary device, and it will be susceptible of being intercepted. Nevertheless, there are some hidden mechanisms (for example if the algorithm is implemented in a computer), but the implementation will not be totally secured. The current design can be easily expanded to a greater block size, i.e, for a 256 bits block size, some of the functional units must be multiplied by 2. The control will not need any modification.. The cipher structure can be used for any block length, if the new system byte size is a 4 multiple of the actual one, with a minimum of 4 bytes. The KeyAdition and ByteSub transformations are independent of the block length. The only transformation that depends on the block length block is ShiftRow. or block length, an array with the shift rows that take place must be defined. A parallel processing, in order to code information, is accomplished using multiple devices. or this purpose, it is necessary to distribute the control signals over the resulting system. One device will act as "master" and it will generate the control signals. These control signals will have access to the external bus (control bus). The rest devices will not implement control unit, instead, they will have some input control pines. An example of this is that with this plan is shown in figure 4, if is had 4 devices, the speed of ciphered would be four times the actual codification speed, for example, using the actual implementation, we will obtain 96,2 Mbps. If change actual block lenght, 128 bits, to 256 bits, we will get an speed equal to 193,2 Mbps. MASTER CONTROL UNIT PLD1 SLAVE PLD3 CONTROL SIGNALS CONTROL SIGNALS={SUMA, 2, 1, 0, CELL, AKEY, CLR,LDMIX,LDSH,,M,S,LDL,LDH} igure 4: Parallel process configuration with distributed control SLAVE PLD2 SLAVE PLD4 4 Conclusions - Rijndael version v2 has been presented as an excellent algorithm to be hardware integrated, in this case we have proposed a programmable logic device realization. - The system implementation using tables simplifies the complexity and the size of the design in a high degree. - The design is expandable: the each iteration transformations are accomplished in parallel, this is an important advantage for future processors and hardware devoted systems. - The design permits the variations on the specifications, block length as well as key can range from 128 to 256 bits in steps of 32 bit. - Though the number of iterations of Rijndael is fixed in the specification, it can be a variable parameter in the event of improving security. - Rijndael is a very fast algorithm. - The system safety increases, if the keys are implemented inside the cipher. - Key changes are easy affordable. References: [1] Joan Daemen, Vicent Rijmen, AES Proporsal: Rijndael v2. September 1999 [2] ALTERA. lex 10K embedded programmable logic family. Data Sheet v.3. May 1999 [3] ALTERA. MAX+PLUS II Getting Started v.8.1. September 1997.
A High-Performance VLSI Architecture for Advanced Encryption Standard (AES) Algorithm
A High-Performance VLSI Architecture for Advanced Encryption Standard (AES) Algorithm N. M. Kosaraju, M. Varanasi & Saraju P. Mohanty VLSI Design and CAD Laboratory Homepage: http://www.vdcl.cse.unt.edu
More informationAdvanced Encryption Standard and Modes of Operation. Foundations of Cryptography - AES pp. 1 / 50
Advanced Encryption Standard and Modes of Operation Foundations of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) is a symmetric cryptographic algorithm AES has been originally requested
More informationIntroduction to Cryptology. Lecture 17
Introduction to Cryptology Lecture 17 Announcements HW7 due Thursday 4/7 Looking ahead: Practical constructions of CRHF Start Number Theory background Agenda Last time SPN (6.2) This time Feistel Networks
More informationImplementation of the block cipher Rijndael using Altera FPGA
Regular paper Implementation of the block cipher Rijndael using Altera FPGA Piotr Mroczkowski Abstract A short description of the block cipher Rijndael is presented. Hardware implementation by means of
More informationAES Advanced Encryption Standard
AES Advanced Encryption Standard AES is iterated block cipher that supports block sizes of 128-bits and key sizes of 128, 192, and 256 bits. The AES finalist candidate algorithms were MARS, RC6, Rijndael,
More informationCSc 466/566. Computer Security. 6 : Cryptography Symmetric Key
1/56 CSc 466/566 Computer Security 6 : Cryptography Symmetric Key Version: 2012/02/22 16:14:16 Department of Computer Science University of Arizona collberg@gmail.com Copyright c 2012 Christian Collberg
More informationECE596C: Handout #7. Analysis of DES and the AES Standard. Electrical and Computer Engineering, University of Arizona, Loukas Lazos
ECE596C: Handout #7 Analysis of DES and the AES Standard Electrical and Computer Engineering, University of Arizona, Loukas Lazos Abstract. In this lecture we analyze the security properties of DES and
More informationGoals of Modern Cryptography
Goals of Modern Cryptography Providing information security: Data Privacy Data Integrity and Authenticity in various computational settings. Data Privacy M Alice Bob The goal is to ensure that the adversary
More informationUnderstanding Cryptography by Christof Paar and Jan Pelzl. Chapter 4 The Advanced Encryption Standard (AES) ver. October 28, 2009
Understanding Cryptography by Christof Paar and Jan Pelzl www.crypto-textbook.com Chapter 4 The Advanced Encryption Standard (AES) ver. October 28, 29 These slides were prepared by Daehyun Strobel, Christof
More informationEfficient Hardware Design and Implementation of AES Cryptosystem
Efficient Hardware Design and Implementation of AES Cryptosystem PRAVIN B. GHEWARI 1 MRS. JAYMALA K. PATIL 1 AMIT B. CHOUGULE 2 1 Department of Electronics & Telecommunication 2 Department of Computer
More informationFAULT DETECTION IN THE ADVANCED ENCRYPTION STANDARD. G. Bertoni, L. Breveglieri, I. Koren and V. Piuri
FAULT DETECTION IN THE ADVANCED ENCRYPTION STANDARD G. Bertoni, L. Breveglieri, I. Koren and V. Piuri Abstract. The AES (Advanced Encryption Standard) is an emerging private-key cryptographic system. Performance
More informationFPGA Can be Implemented Using Advanced Encryption Standard Algorithm
FPGA Can be Implemented Using Advanced Encryption Standard Algorithm Shahin Shafei Young Researchers and Elite Club, Mahabad Branch, Islamic Azad University, Mahabad, Iran Email:Shahin_shafei@yahoo.com
More informationHOST Cryptography III ECE 525 ECE UNM 1 (1/18/18)
AES Block Cipher Blockciphers are central tool in the design of protocols for shared-key cryptography What is a blockcipher? It is a function E of parameters k and n that maps { 0, 1} k { 0, 1} n { 0,
More informationA New hybrid method in watermarking using DCT and AES
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 10, Issue 11 (November 2014), PP.64-69 A New hybrid method in watermarking using
More informationBlock Ciphers. Lucifer, DES, RC5, AES. CS 470 Introduction to Applied Cryptography. Ali Aydın Selçuk. CS470, A.A.Selçuk Block Ciphers 1
Block Ciphers Lucifer, DES, RC5, AES CS 470 Introduction to Applied Cryptography Ali Aydın Selçuk CS470, A.A.Selçuk Block Ciphers 1 ... Block Ciphers & S-P Networks Block Ciphers: Substitution ciphers
More informationData Encryption Standard (DES)
Data Encryption Standard (DES) Best-known symmetric cryptography method: DES 1973: Call for a public cryptographic algorithm standard for commercial purposes by the National Bureau of Standards Goals:
More informationFPGA CAN BE IMPLEMENTED BY USING ADVANCED ENCRYPTION STANDARD ALGORITHM
FPGA CAN BE IMPLEMENTED BY USING ADVANCED ENCRYPTION STANDARD ALGORITHM P. Aatheeswaran 1, Dr.R.Suresh Babu 2 PG Scholar, Department of ECE, Jaya Engineering College, Chennai, Tamilnadu, India 1 Associate
More informationContent of this part
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Introduction to Cryptography ECE 597XX/697XX Part 4 The Advanced Encryption Standard (AES) Israel Koren ECE597/697 Koren Part.4.1
More informationFPGA BASED CRYPTOGRAPHY FOR INTERNET SECURITY
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 10, October 2015,
More informationSpeeding Up AES By Extending a 32 bit Processor Instruction Set
Speeding Up AES By Extending a bit Processor Instruction Set Guido Marco Bertoni ST Microelectronics Agrate Briaznza, Italy bertoni@st.com Luca Breveglieri Politecnico di Milano Milano, Italy breveglieri@elet.polimi.it
More informationDesign of an Efficient Architecture for Advanced Encryption Standard Algorithm Using Systolic Structures
Design of an Efficient Architecture for Advanced Encryption Standard Algorithm Using Systolic Structures 1 Suresh Sharma, 2 T S B Sudarshan 1 Student, Computer Science & Engineering, IIT, Khragpur 2 Assistant
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 5a January 29, 2013 CPSC 467b, Lecture 5a 1/37 Advanced Encryption Standard AES Alternatives CPSC 467b,
More informationDesign and Implementation of Rijndael Encryption Algorithm Based on FPGA
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 2, Issue. 9, September 2013,
More informationComparison of Performance of AES Standards Based Upon Encryption /Decryption Time and Throughput
Comparison of Performance of AES Standards Based Upon Encryption /Decryption Time and Throughput Miss Navraj Khatri Mr Jagtar Singh Mr Rajeev dhanda NCCE,Israna,K.U Senior lecturer,ncce,israna,k.u Assistant
More informationCryptography Functions
Cryptography Functions Lecture 3 1/29/2013 References: Chapter 2-3 Network Security: Private Communication in a Public World, Kaufman, Perlman, Speciner Types of Cryptographic Functions Secret (Symmetric)
More informationImplementation and Performance analysis of Skipjack & Rijndael Algorithms. by Viswnadham Sanku ECE646 Project Fall-2001
Implementation and Performance analysis of Skipjack & Rijndael Algorithms by Viswnadham Sanku ECE646 Project Fall-2001 TABLE OF CONTENTS TABLE OF CONTENTS 2 1. OBJECTIVE 3 2. SKIPJACK CIPHER 3 2.1 CIPHER
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 5 January 23, 2012 CPSC 467b, Lecture 5 1/35 Advanced Encryption Standard AES Alternatives CPSC 467b,
More informationFPGA Implementation of High Speed AES Algorithm for Improving The System Computing Speed
FPGA Implementation of High Speed AES Algorithm for Improving The System Computing Speed Vijaya Kumar. B.1 #1, T. Thammi Reddy.2 #2 #1. Dept of Electronics and Communication, G.P.R.Engineering College,
More informationCourse Business. Midterm is on March 1. Final Exam is Monday, May 1 (7 PM) Allowed to bring one index card (double sided) Location: Right here
Course Business Midterm is on March 1 Allowed to bring one index card (double sided) Final Exam is Monday, May 1 (7 PM) Location: Right here 1 Cryptography CS 555 Topic 18: AES, Differential Cryptanalysis,
More informationEncryption Details COMP620
Encryption Details COMP620 Encryption is a powerful defensive weapon for free people. It offers a technical guarantee of privacy, regardless of who is running the government It s hard to think of a more
More informationWinter 2011 Josh Benaloh Brian LaMacchia
Winter 2011 Josh Benaloh Brian LaMacchia Symmetric Cryptography January 20, 2011 Practical Aspects of Modern Cryptography 2 Agenda Symmetric key ciphers Stream ciphers Block ciphers Cryptographic hash
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Secret Key Cryptography Block cipher DES 3DES
More informationL3: Basic Cryptography II. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806
L3: Basic Cryptography II Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 8/29/2016 CSCI 451 -Fall 2016 1 Acknowledgement Many slides are from or
More informationSecret Key Cryptography
Secret Key Cryptography General Block Encryption: The general way of encrypting a 64-bit block is to take each of the: 2 64 input values and map it to a unique one of the 2 64 output values. This would
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 Advance Encryption Standard (AES) Rijndael algorithm is symmetric block cipher that can process data blocks of 128 bits, using cipher keys with lengths of 128, 192, and 256
More informationAnalysis of the Use of Whirlpool s S-box, S1 and S2 SEED s S- box in AES Algorithm with SAC Test Novita Angraini, Bety Hayat Susanti, Magfirawaty
Information Systems International Conference (ISICO), 2 4 December 2013 Analysis of the Use of Whirlpool s S-box, S1 and S2 SEED s S- box in AES Algorithm with SAC Test Novita Angraini, Bety Hayat Susanti,
More informationCryptography and Network Security. Sixth Edition by William Stallings
Cryptography and Network Security Sixth Edition by William Stallings Chapter 5 Advanced Encryption Standard Advance Encryption Standard Topics Origin of AES Basic AES Inside Algorithm Final Notes Origins
More informationCryptography and Network Security
Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 6: Advanced Encryption Standard (AES) Ion Petre Department of IT, Åbo Akademi University 1 Origin of AES 1999: NIST
More informationFew Other Cryptanalytic Techniques
Few Other Cryptanalytic Techniques Debdeep Mukhopadhyay Assistant Professor Department of Computer Science and Engineering Indian Institute of Technology Kharagpur INDIA -721302 Objectives Boomerang Attack
More informationPARALLEL ANALYSIS OF THE RIJNDAEL BLOCK CIPHER
PARALLEL ANALYSIS OF THE RIJNDAEL BLOCK CIPHER Philip Brisk, Adam Kaplan, Majid Sarrafzadeh Computer Science Department, University of California Los Angeles 3532C Boelter Hall, Los Angeles, CA 90095-1596
More informationImplementation of Full -Parallelism AES Encryption and Decryption
Implementation of Full -Parallelism AES Encryption and Decryption M.Anto Merline M.E-Commuication Systems, ECE Department K.Ramakrishnan College of Engineering-Samayapuram, Trichy. Abstract-Advanced Encryption
More informationLecture 2: Secret Key Cryptography
T-79.159 Cryptography and Data Security Lecture 2: Secret Key Cryptography Helger Lipmaa Helsinki University of Technology helger@tcs.hut.fi 1 Reminder: Communication Model Adversary Eve Cipher, Encryption
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 7 September 23, 2015 CPSC 467, Lecture 7 1/1 Advanced Encryption Standard AES Alternatives CPSC 467,
More informationin a 4 4 matrix of bytes. Every round except for the last consists of 4 transformations: 1. ByteSubstitution - a single non-linear transformation is a
Cryptanalysis of Reduced Variants of Rijndael Eli Biham Λ Nathan Keller y Abstract Rijndael was submitted to the AES selection process, and was later selected as one of the five finalists from which one
More informationBus Matrix Synthesis Based On Steiner Graphs for Power Efficient System on Chip Communications
Bus Matrix Synthesis Based On Steiner Graphs for Power Efficient System on Chip Communications M.Jasmin Assistant Professor, Department Of ECE, Bharath University, Chennai,India ABSTRACT: Power consumption
More informationImplementation and Performance analysis of Skipjack & Rijndael Algorithms
Implementation and Performance analysis of Skipjack & Rijndael Algorithms By Viswanadham Sanku 1 Topics Skipjack cipher operations Design principles & cryptanalysis Implementation & optimization Results
More informationFPGA Based Design of AES with Masked S-Box for Enhanced Security
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 3 Issue 5ǁ May 2014 ǁ PP.01-07 FPGA Based Design of AES with Masked S-Box for Enhanced Security
More informationHIGH DATA RATE 8-BIT CRYPTO PROCESSOR
HIGH DATA RATE 8-BIT CRYPTO PROCESSOR Sheikh M Farhan, Habibullah Jamal, Mohsin Rahmatullah University of Engineering and Technology, Taxila, Pakistan smfarhan@carepvtltd.com, (+92-51-2874794), 19-Ataturk
More informationDesign Implementation of Composite Field S-Box using AES 256 Algorithm
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 12, December 2016, PP 43-51 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Design Implementation of Composite Field
More informationOptimized AES Algorithm Using FeedBack Architecture Chintan Raval 1, Maitrey Patel 2, Bhargav Tarpara 3 1, 2,
Optimized AES Algorithm Using FeedBack Architecture Chintan Raval 1, Maitrey Patel 2, Bhargav Tarpara 3 1, 2, Pursuing M.Tech., VLSI, U.V.Patel college of Engineering and Technology, Kherva, Mehsana, India
More informationWeek 5: Advanced Encryption Standard. Click
Week 5: Advanced Encryption Standard Click http://www.nist.gov/aes 1 History of AES Calendar 1997 : Call For AES Candidate Algorithms by NIST 128-bit Block cipher 128/192/256-bit keys Worldwide-royalty
More informationLecture 5. Encryption Continued... Why not 2-DES?
Lecture 5 Encryption Continued... 1 Why not 2-DES? 2DES: C = DES ( K1, DES ( K2, P ) ) Seems to be hard to break by brute force, approx. 2 111 trials Assume Eve is trying to break 2DES and has a single
More informationHigh Performance Single-Chip FPGA Rijndael Algorithm Implementations
High Performance Single-Chip FPGA Rijndael Algorithm Implementations Máire McLoone and J.V McCanny DSiP TM Laboratories, School of Electrical and Electronic Engineering, The Queen s University of Belfast,
More informationAES as A Stream Cipher
> AES as A Stream Cipher < AES as A Stream Cipher Bin ZHOU, Kris Gaj, Department of ECE, George Mason University Abstract This paper presents implementation of advanced encryption standard (AES) as a stream
More informationOutline. Data Encryption Standard. Symmetric-Key Algorithms. Lecture 4
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 4 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org Outline Review
More informationA Low Device Occupation IP to Implement Rijndael Algorithm
A Low Device Occupation IP to Implement Rijndael Algorithm Alex Panato, Marcelo Barcelos, Ricardo Reis Universidade Federal do Rio Grande do Sul PPGC - Instituto de Informática P.O. Box 15064. CEP 91501-970
More informationThe NSA's Role In Computer Security. Adrien Cheval Joe Willage
The NSA's Role In Computer Security Adrien Cheval Joe Willage Introduction NSA was created in 1952 Located in Ft. Meade, Maryland Cryptographic intelligence agency of the U.S. government Part of the Department
More information128 Bit ECB-AES Crypto Core Design using Rijndeal Algorithm for Secure Communication
IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 03, 2014 ISSN (online): 2321-0613 128 Bit ECB-AES Crypto Core Design using Rijndeal Algorithm for Secure Communication
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 23 wenbing@ieee.org (Lecture notes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Introduction to
More informationAES ALGORITHM FOR ENCRYPTION
Volume 02 - Issue 05 May 2016 PP. 63-68 AES ALGORITHM FOR ENCRYPTION Radhika D.Bajaj M.Tech VLSI G.H. Raisoni Institute of Engineering And Technology For Women, Nagpur. Dr. U.M. Gokhale Electronics and
More informationBlock Ciphers Introduction
Technicalities Block Models Block Ciphers Introduction Orr Dunkelman Computer Science Department University of Haifa, Israel March 10th, 2013 Orr Dunkelman Cryptanalysis of Block Ciphers Seminar Introduction
More informationHigh-Performance Cryptography in Software
High-Performance Cryptography in Software Peter Schwabe Research Center for Information Technology Innovation Academia Sinica September 3, 2012 ECRYPT Summer School: Challenges in Security Engineering
More informationPresented by: Kevin Hieb May 2, 2005
Presented by: Kevin Hieb May 2, 2005 Governments National Finances National Security Citizens Companies Data Loss Monetary Loss Individuals Identity Theft Data Loss Networks Firewalls Intrusion Detection
More informationImplementation and Comparative Analysis of AES as a Stream Cipher
Implementation and Comparative Analysis of AES as a Stream Cipher Bin ZHOU, Yingning Peng Dept. of Electronic Engineering, Tsinghua University, Beijing, China, 100084 e-mail: zhoubin06@mails.tsinghua.edu.cn
More informationLecture 4. Encryption Continued... Data Encryption Standard (DES)
Lecture 4 Encryption Continued... 1 Data Encryption Standard (DES) 64 bit input block 64 bit output block 16 rounds 64 (effective 56) bit key Key schedule computed at startup Aimed at bulk data >16 rounds
More informationCSCI 454/554 Computer and Network Security. Topic 3.1 Secret Key Cryptography Algorithms
CSCI 454/554 Computer and Network Security Topic 3.1 Secret Key Cryptography Algorithms Outline Introductory Remarks Feistel Cipher DES AES 2 Introduction Secret Keys or Secret Algorithms? Security by
More informationIMPROVEMENT KEYS OF ADVANCED ENCRYPTION STANDARD (AES) RIJNDAEL_M
IMPROVEMENT KEYS OF ADVANCED ENCRYPTION STANDARD (AES) RIJNDAEL_M 1,2 MOHANAAD SHAKIR, 2 ASMIDAR BIT ABUBAKAR, 2 YOUNUS BIN YOUSOFF, 3 MUSTEFA SHEKER 1 Alburaimi University Collage(BUC), Oman, 2 University
More informationAES Core Specification. Author: Homer Hsing
AES Core Specification Author: Homer Hsing homer.hsing@gmail.com Rev. 0.1.1 October 30, 2012 This page has been intentionally left blank. www.opencores.org Rev 0.1.1 ii Revision History Rev. Date Author
More informationEfficient Area and High Speed Advanced Encryption Standard Algorithm
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 7, July 2015, PP 140-146 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Efficient Area and High Speed Advanced Encryption
More informationAIT 682: Network and Systems Security
AIT 682: Network and Systems Security Topic 3.1 Secret Key Cryptography Algorithms Instructor: Dr. Kun Sun Outline Introductory Remarks Feistel Cipher DES AES 2 Introduction Secret Keys or Secret Algorithms?
More informationLow area implementation of AES ECB on FPGA
Total AddRoundkey_3 MixCollumns AddRoundkey_ ShiftRows SubBytes 1 Low area implementation of AES ECB on FPGA Abstract This project aimed to create a low area implementation of the Rajindael cipher (AES)
More informationSymmetric Key Algorithms. Definition. A symmetric key algorithm is an encryption algorithm where the same key is used for encrypting and decrypting.
Symmetric Key Algorithms Definition A symmetric key algorithm is an encryption algorithm where the same key is used for encrypting and decrypting. 1 Block cipher and stream cipher There are two main families
More informationPiret and Quisquater s DFA on AES Revisited
Piret and Quisquater s DFA on AES Revisited Christophe Giraud 1 and Adrian Thillard 1,2 1 Oberthur Technologies, 4, allée du doyen Georges Brus, 33 600 Pessac, France. c.giraud@oberthur.com 2 Université
More informationModern Symmetric Block cipher
Modern Symmetric Block cipher 81 Shannon's Guide to Good Ciphers Amount of secrecy should determine amount of labour appropriate for encryption and decryption The set of keys and enciphering algorithm
More informationEnhanced Cryptanalysis of Substitution Cipher Chaining mode (SCC-128)
Enhanced Cryptanalysis of Substitution Cipher Chaining mode (SCC-128) Mohamed Abo El-Fotouh and Klaus Diepold Institute for Data Processing (LDV) Technische Universität München (TUM) 80333 Munich Germany
More informationAES Cryptosystem Acceleration Using Graphics Processing Units. Ethan Willoner Supervisors: Dr. Ramon Lawrence, Scott Fazackerley
AES Cryptosystem Acceleration Using Graphics Processing Units Ethan Willoner Supervisors: Dr. Ramon Lawrence, Scott Fazackerley Overview Introduction Compute Unified Device Architecture (CUDA) Advanced
More informationSharing Resources Between AES and the SHA-3 Second Round Candidates Fugue and Grøstl
Sharing Resources Between AES and the SHA-3 Second Round Candidates Fugue and Grøstl Kimmo Järvinen Department of Information and Computer Science Aalto University, School of Science and Technology Espoo,
More informationUsing Error Detection Codes to detect fault attacks on Symmetric Key Ciphers
Using Error Detection Codes to detect fault attacks on Symmetric Key Ciphers Israel Koren Department of Electrical and Computer Engineering Univ. of Massachusetts, Amherst, MA collaborating with Luca Breveglieri,
More informationSymmetric-Key Cryptography
Symmetric-Key Cryptography CS 161: Computer Security Prof. Raluca Ada Popa Sept 13, 2016 Announcements Project due Sept 20 Special guests Alice Bob The attacker (Eve - eavesdropper, Malice) Sometimes Chris
More informationVLSI Implementation of Enhanced AES Cryptography
ISSN (e): 2250 3005 Vol, 04 Issue, 7 July 2014 International Journal of Computational Engineering Research (IJCER) VLSI Implementation of Enhanced AES Cryptography Lakavath Srinivas 1, Zuber M. Patel 2,
More informationGoals for Today. Substitution Permutation Ciphers. Substitution Permutation stages. Encryption Details 8/24/2010
Encryption Details COMP620 Goals for Today Understand how some of the most common encryption algorithms operate Learn about some new potential encryption systems Substitution Permutation Ciphers A Substitution
More informationSecret Key Cryptography
Secret Key Cryptography 1 Block Cipher Scheme Encrypt Plaintext block of length N Decrypt Secret key Cipher block of length N 2 Generic Block Encryption Convert a plaintext block into an encrypted block:
More informationENEE 459-C Computer Security. Symmetric key encryption in practice: DES and AES algorithms
ENEE 459-C Computer Security Symmetric key encryption in practice: DES and AES algorithms A perfect encryption of a block Say you have a block of n bits You want to encrypt it You want to use the same
More informationImplementing AES : performance and security challenges
Implementing AES 2000-2010: performance and security challenges Emilia Käsper Katholieke Universiteit Leuven SPEED-CC Berlin, October 2009 Emilia Käsper Implementing AES 2000-2010 1/ 31 1 The AES Performance
More informationP2_L6 Symmetric Encryption Page 1
P2_L6 Symmetric Encryption Page 1 Reference: Computer Security by Stallings and Brown, Chapter 20 Symmetric encryption algorithms are typically block ciphers that take thick size input. In this lesson,
More informationSecurity against Timing Analysis Attack
International Journal of Electrical and Computer Engineering (IJECE) Vol. 5, No. 4, August 2015, pp. 759~764 ISSN: 2088-8708 759 Security against Timing Analysis Attack Deevi Radha Rani 1, S. Venkateswarlu
More informationIntroduction to the new AES Standard: Rijndael
Introduction to the new AES Standard: Rijndael Paul Donis This paper will explain how the Rijndael Cipher Reference Code in C works. Rijndael is a block cipher that encrypts and decrypts 128, 192, and
More informationShrivathsa Bhargav Larry Chen Abhinandan Majumdar Shiva Ramudit
Shrivathsa Bhargav Larry Chen Abhinandan Majumdar Shiva Ramudit May 10, 2008 Spring 2008, Columbia University System architecture SDRAM chip AES decrypto Nios II processor SDRAM controller Avalon Bus VGA
More informationArea Optimization in Masked Advanced Encryption Standard
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 06 (June. 2014), V1 PP 25-29 www.iosrjen.org Area Optimization in Masked Advanced Encryption Standard R.Vijayabhasker,
More informationCryptompress: A Symmetric Cryptography algorithm to deny Bruteforce Attack
Cryptompress: A Symmetric Cryptography algorithm to deny Bruteforce Attack Vivek Kumar 1 and Sandeep Sharma 2 1,2 Department of Electronics and Communication Engineering, Dehradun Institute of Technology,
More informationDesign and Implementation of Rijindael s Encryption and Decryption Algorithm using NIOS- II Processor
Design and Implementation of Rijindael s Encryption and Decryption Algorithm using NIOS- II Processor Monika U. Jaiswal 1, Nilesh A. Mohota 2 1 Student, Electronics Department, JDCOEM, Nagpur, India 2
More informationHardware Implementation of Cryptosystem by AES Algorithm Using FPGA
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationScanned by CamScanner
Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Symmetric-Key Cryptography CS 161: Computer Security
More informationFPGA IMPLEMENTATION OF HIGHLY AREA EFFICIENT ADVANCED ENCRYPTION STANDARD ALGORITHM
FPGA IMPLEMENTATION OF HIGHLY AREA EFFICIENT ADVANCED ENCRYPTION STANDARD ALGORITHM D. Arivazhaki, V. Vijayakumar and T. Ravi Department of Electronics and Communication Engineering, Sathyabama University,
More informationL3. An Introduction to Block Ciphers. Rocky K. C. Chang, 29 January 2015
L3. An Introduction to Block Ciphers Rocky K. C. Chang, 29 January 2015 Outline Product and iterated ciphers A simple substitution-permutation network DES and AES Modes of operations Cipher block chaining
More informationCS Network Security. Module 6 Private Key Cryptography
CS 393 - Network Security Module 6 Private ey Cryptography Data Encryption Encryption is the process of encoding a message such that its meaning is not obvious. Decryption is the reverse process, ie, transforming
More informationBlock Ciphers. Secure Software Systems
1 Block Ciphers 2 Block Cipher Encryption function E C = E(k, P) Decryption function D P = D(k, C) Symmetric-key encryption Same key is used for both encryption and decryption Operates not bit-by-bit but
More informationVLSI Implementation of Advanced Encryption Standard for secured Electronic Voting Machine
www.ijraset.com VLSI Implementation of Advanced Encryption Standard for secured Electronic Voting Machine A. Jesu Silvancy 1, A. Jeyapaul Murugan 2 1 PG Scholar, 2 Assistant Professor, Dr. Sivanthi Aditanar
More informationVortex: A New Family of One-way Hash Functions Based on AES Rounds and Carry-less Multiplication
Vortex: A New Family of One-way Hash Functions Based on AES Rounds and Carry-less ultiplication Shay Gueron 2, 3, 4 and ichael E. Kounavis 1 1 Corresponding author, Corporate Technology Group, Intel Corporation,
More informationEncryption and Decryption by AES algorithm using FPGA
Encryption and Decryption by AES algorithm using FPGA Sayali S. Kshirsagar Department of Electronics SPPU MITAOE, Alandi(D), Pune, India sayali.kshirsagar17@gmail.com Savita Pawar Department of Electronics
More information