TEXT AND IMAGE ENCRYPTION DECRYPTION

USING
ADVANCED ENCRYPTION STANDARD(AES)

A Project by

P.Pavan Kalyan(31417710189)
P.Naga Ramya (314177110114)
P.Jayaram Sai (314177110197)
Ch.Ganesh (314177110191)
 ABSTRACT

In today’s world most of the communication is done using electronic media. Data security plays a vital
in such communication. Hence, there is a need to protect data from malicious attacks. This can be achieved
by cryptography. The earlier encryption algorithm is Data Encryption Standard(DES) which has several
loopholes such as small key size and sensible to brute force attacks etc. These loopholes overcome by a new
algorithm called as Advanced Encryption Standard(AES).

In this project work, the plain text of 128 bits is given as input to encryption block in which encryption
of data is made and the cipher text of 128 bits is throughout as output The key length of 128 bits is used in
process for both encryption and decryption of data blocks. Hence it is called a symmetric key cryptography.
The rounds in decryption are exact in inverse of encryption. There are four rounds in encryption
SubBytes,Shiftrows,MixColumns and AddRoundKey.Similarly for decryption we have
InvSubBytes,InvShiftRows,InvMixColumns and InvAddRoundKey. The number of times operation
performed is depend on key length i.e. for 128 bits we have 10 rounds.
 EXISTING SYSTEM

Data security plays a vital in such communication. Hence, there is a need to protect data from
malicious attacks. This can be achieved by cryptography. The earlier encryption algorithm is Data
Encryption Standard(DES) which has several loopholes such as small key size(56 bit) and sensible to brute
force attacks etc.
Disadvantages:
It's possible to brute-force in finite time on modern processors, so no-one uses it for anything serious
anymore. Also, some password systems secured with DES were limited to 8 characters and would silently
truncate otherwise-secure passwords (match only the first 8 characters)
 PROPOSED SYSTEM

In this project work, the plain text of 128 bits is given as input to encryption block in which encryption of
data is made and the cipher text of 128 bits is throughout as output The key length of 128 bits is used in process
for both encryption and decryption of data blocks. Hence it is called a symmetric key cryptography. The rounds in
decryption are exact in inverse of encryption. There are four rounds in encryption
SubBytes,Shiftrows,MixColumns and AddRoundKey.Similarly for decryption we have
InvSubBytes,InvShiftRows,InvMixColumns and InvAddRoundKey. The number of times operation performed is
depend on key length i.e. for 128 bits we have 10 rounds.
 AES is more secure (it is less susceptible to cryptanalysis than 3DES).
 AES supports larger key sizes than 3DES's 112 or 168 bits.
 AES is faster in both hardware and software.
 AES's 128-bit block size makes it less open to attacks via the than 3DES with its 64-bit block
size.
 AES is required by the latest U.S. and international standards.
 REQUIREMENTS
 Hardware Requirements:
RAM 1GB or above
HARD DISK 40 GB or above
PROCESSOR Pentium IV and above
 Software Requirements:
Operating System:
 LINUX
 Windows
Language used:
Java
Editor:
Eclipse
Functional Requirements:


 MODULES

 Encryption Operation
 SubBytes
 ShiftRows
 MixColumns
 AddRound key

 Decryption Operation
 InvAddRound key
 InvMixColumns
 InvShiftRows
 InvSubBytes

 Key Expansion
 INTRODUCTION

 AES is based on a design principle known as a substitution-permutation network, a combination of both

substitution and permutation, and is fast in both software and hardware.
 AES is a variant of Rijndael which has a fixed block size of 128 bits, and a key size of 128, 192, or 256 bits.
By contrast, the Rijndael specification per se is specified with block and key sizes that may be any multiple
of 32 bits, with a minimum of 128 and a maximum of 256 bits.
 AES operates on a 4 × 4 column-major order matrix of bytes, termed the state, although some versions of
Rijndael have a larger block size.
 The key size used for an AES cipher specifies the number of repetitions of transformation rounds that
convert the input, called the plaintext, into the final output, called the ciphertext. The number of cycles of
repetition are as follows:
10 cycles of repetition for 128-bit keys.
12 cycles of repetition for 192-bit keys.
14 cycles of repetition for 256-bit keys.
 Each round consists of several processing steps, each containing four similar but different stages, including
one that depends on the encryption key itself. A set of reverse rounds are applied to transform ciphertext
back into the original plaintext using the same encryption key.
 Encryption Operation
 Byte Substitution(SubBytes):
The 16 input bytes are substituted by looking up a fixed table S − box given in design. The result is in a matrix of four rows and
four columns.
 Shiftrows:
Each of the four rows of the matrix is shifted to the left. Any entries that ‘fall off’ are re-inserted on the right side of row. Shift is
carried out as follows −
First row is not shifted.
Second row is shifted one byte position to the left.
Third row is shifted two positions to the left.
Fourth row is shifted three positions to the left.
The result is a new matrix consisting of the same 16 bytes but shifted with respect to each other.
 MixColumns:
Each column of four bytes is now transformed using a special mathematical function. This function takes as input the four bytes
of one column and outputs four completely new bytes, which replace the original column. The result is another new matrix consisting of 16
new bytes. It should be noted that this step is not performed in the last round.
 AddRoundKey:
The 16 bytes of the matrix are now considered as 128 bits and are XORed to the 128 bits of the round key. If this is the last round
then the output is the ciphertext. Otherwise, the resulting 128 bits are interpreted as 16 bytes and we begin another similar round.
Decryption Operation

 The process of decryption of an AES ciphertext is similar to the encryption process in the reverse order.
Each round consists of the four processes conducted in the reverse order.
InvAdd round key
InvMix columns
InvShift rows
InvByte substitution

Key Expansion:

 Key expansion refers to the process in which the 128 bits of the original key are expanded into eleven
128-bit round keys. To compute round key (n+1) from round key (n).
OUTPUT SCREENS
INTIAL SCREEN
AFTER ENTERING THE KEYWORD AND ORIGINAL TEXT
THE CIPHER TEXT
THE DECIPHER TEXT
MONITOR
Thank you…..