Download - Byte Rotation Algorithm
05/03/2023 1
A new approach towards encryption schemes:
Byte- Rotation encryption algorithm
Presented By: Jamal KhanContact: 00923219035609
E-mail: [email protected]
05/03/2023 2
Contents What is BREA? Previous used encryption algorithms BREA Algorithm Steps Example BREA with parallel encryption model Byte rotation with “CBC encryption algorithm” Advantages Future enchancement Conclusion Refrences
05/03/2023 3
What is BREA?oByte Rotation Encryption algorithm(BREA)
(developed in 2012) is a symmetric key block cipher algorithm which is applied on different blocks of plaintext and executes in parallel manner through multithreading concept of single processor system.
oMultithreading is a technique at which a single set of code can be used by different processors at different stages of execution.
05/03/2023 4
Previous used algorithms
oEarlier many researchers have proposed various encryption algorithms such as AED,DES, Triple DES,RSA, Blowfish etc.
oSome of them are most popular in achieving data security at a great exent like AES and Blowfish.
oWith increase in security level, the time and complexity of algorithm is also increased and this is the major cause of decreasing the speed and efficiency of encryption system.
05/03/2023 6
Byte Rotation Encryption Algorithm
It is symmetric key block cipher algorithm
Each block size of 16 bytes
Size of Matrix is 16 bytes
Value of matrix are randomly selected and are ranging from 1-26
Mono alphabetic substitution concept is followed
Byte rotation technique is used
05/03/2023 7
Steps1. The letters of the alphabet are assigned
numerical values from 1 to 26 in sequence i.e. A,B,C,D,…,Y,Z assigned numerical values 1,2,3,….26 respectively.
2. The plaintext is partitioned into fixed-length blocks of size 16 bytes (128 bits) each. These blocks are represented by a matrix Mp.
3. The values of key matrix (K) are randomly selected from the range 1 to 26. The size of key matrix is equivalent to the block size of plaintext i.e. 16 bytes. K=[K1,K2,K3,………….K16].
4. Calculate the transpose matrix of plaintext block matrix (MP), which is denoted by (MP)T.
05/03/2023 8
Continue…5. Calculate the encrypted key matrix Ke using the
following formula: Ke = K mod 26. Add both the matrices MPT and Ke and the resultant
matrix is denoted by CPK. CPK = MPT + Ke
7. Rotate the first three rows horizontally of CPK matrix such that rotate one byte from first row, rotate two bytes from second row, rotate three bytes from third row and fourth remains unchanged. The resultant matrix is denoted by Chr.
8. Rotate first three columns vertically of Chr matrix such that rotate one byte from first column, rotate two bytes from second column, rotate three bytes from third column and fourth column remains unchanged.
The resultant matrix is denoted by CVR.
05/03/2023 9
Continue ….9. Replace numeric values of CVR matrix by their
corresponding letters and if 36 exist in CVR matrix, it is replaced by special character #. The resultant matrix is denoted by Ce.
05/03/2023 14
Advantages
Very Secure
Require less
computer
resources
No complex calculatio
n
Very Fast
05/03/2023 15
Future Enhancement
• The system can be easily modified to accept any encryption algorithm which would be framed in future.• Moreover, currently concentration on the
next work which adopts Parallelism through multiprocessor system where various encryption algorithms can run in parallel environment which enhances the performance and speed of Encryption/Decryption process.
05/03/2023 16
Conclusion
• The concept of block wise parallel encryption using multithreading technique enhances the speed of encryption system. The system which use “BREA” provides enough security. Thus the system is justified for its use in securing files.
05/03/2023 17
References• [1] MAHENDRAN R “BYTE ROTATION WITH CBC
ENCRYPTION ALGORITHM” International Journal of Machine and Construction Engineering Volume 1 Issue 1 Aug 2014.
• [2] Nidhi Gouttam “Implementation Of Simulation Of Byte Rotation Encryption Algorithm” INTERNATIONAL JOURNAL OF TECHNOLOGY ENHANCEMENTS AND EMERGING ENGINEERING RESEARCH, VOL 2, ISSUE 5 ISSN 2347-4289
• [3] Sunita Bhatti & Prof. S. K. Sharma, “Block Wise Parallel Encryption through Multithreading Concept”, Research Paper published in Aishwarya Research Communication Journal (ISSN: 0975-3613) Vol. 3, August 2011.