0% found this document useful (0 votes)
143 views4 pages

Enhanced IDEA Encryption Algorithm

The document discusses the International Data Encryption Algorithm (IDEA) and proposes a modified version called Secure IDEA (S-IDEA). IDEA is a symmetric-key block cipher that encrypts data in 64-bit blocks using a 128-bit key. S-IDEA increases the key size to 256 bits and uses two multiplicative-additive blocks per round instead of one to strengthen security.

Uploaded by

EXTERMINATOR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
143 views4 pages

Enhanced IDEA Encryption Algorithm

The document discusses the International Data Encryption Algorithm (IDEA) and proposes a modified version called Secure IDEA (S-IDEA). IDEA is a symmetric-key block cipher that encrypts data in 64-bit blocks using a 128-bit key. S-IDEA increases the key size to 256 bits and uses two multiplicative-additive blocks per round instead of one to strengthen security.

Uploaded by

EXTERMINATOR
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

International Journal of Engineering Trends and Technology (IJETT) – Volume 67 Issue 11- Nov 2019

Implementation of International Data


Encryption Algorithm
P.Devi Pradeep#1, Dr.A.Kamala Kumari*2
#
Department of ECE , ANITS ,VISAKHAPATNAM, India-531162
* Department of instrument Technology, ANDHRAUNIVERSITY, VISAKHAPATNAM, India-530003

Abstract The fundamental keywords are defined below.


Now-a-days there are many security algorithms that  Plain text: This is the original message that
are used for security purpose. IDEA is one of them. is intelligible and is fed into the algorithm as
The block cipher IDEA operates with 64-bit plaintext input.
and cipher text blocks and is controlled by a 128-bit  Encryption algorithm: It performs various
key. The fundamental innovation in the design of this operations and transformations on the
algorithm is the use of operations from three different original message (plain text).
algebraic groups. The algorithm structure has been  Secret key: It is shared between the sender
chosen such that, with the exception that different key and the recipient, and is used as an input to
sub-blocks are used, the encryption process is the algorithm.
identical to the decryption process. The drawback of  Cipher text: It is the algorithm’s output. It is
IDEA is that the large numbers of weak keys were scrambled message and unintelligible that
found in IDEA (International Data Encryption depends on the plain text and encryption key.
Algorithm). Also a new attack on round 6 of IDEA  Decryption algorithm: The reverse operation
has been detected. This paper describes the design is applied on the cipher text to get the plain
and implementation of secure data encryption text (original).
algorithm(S-IDEA) protocol, the size of the key has
been increased from 128 bits to 256 bits. This
increased key size will increase the complexity of the II. CRYPTOGRAPHY
algorithm. To increase the amount of diffusion two It is a technique used to avoid an unauthorized access
MA blocks (multiplicative additive block) are used in of data. It helps to provide accountability fairness and
a single round of IDEA as compared to one MA block accuracy and also provide confidentiality. Broadly,
used previously in a single round, with these four different kinds of people contributed their efforts
modifications in the proposed algorithm will increase in this technique and are: (i) Military, (ii) The
the cryptographic strength. Diplomatic Corps,(iii) Diarists, and (iv)
Communications System. Cryptography involves two
Keywords — cipher, cryptography, encryption, basic operations and is named as encryption and key
decryption, key management. Information/data can be encrypted
using a cryptographic algorithm by various keys. The
I. INTRODUCTION security of cryptographic system is not only
The International Data Encryption Algorithm (IDEA) dependent on the encryption algorithm but also
is a symmetric-key, block cipher. It was published in depends upon the keys used for the encryption. These
1991 by Lai, Massey, and Murphy. IDEA is a keys are always kept secured from the hacker and are
modification of the Proposed Encryption Standard known as secret key. Key plays an important role in
(PES) that was published in 1990 by Lai and Massy; encryption process, which is a main part of
PES was designed as a replacement for the Data cryptography.
Encryption Standard (DES). The algorithm was
modified and published in 1991 after Biham and A. Need of Cryptography
Shamir described the technique of differential As almost all the organizations such as banks,
cryptanalysis. The new algorithm was called the railway, military, telecommunication, etc depends
Improved Proposed Encryption Standard (IPES); its upon wireless approaches and are open to all the
name changed to IDEA in 1992. IDEA is a candidate computer and the networks (LAN, MAN and WAN).
block cipher to the NESSIE Project. NESSIE is a Their transfer of funds, information and data all are
project within the Information Societies Technology carried out online. Secured funding and E-mails are
(IST) Program of the European Commission. the major requirement of all the above said
Although IDEA did not replace DES, it was organizations; therefore, it is highly essential to
incorporated into Pretty Good Privacy (PGP). protect the data from the intruders. Electronic data
transfer is used in all the present applications and it

ISSN: 2231-5381 http://www.ijettjournal.org Page 31


International Journal of Engineering Trends and Technology (IJETT) – Volume 67 Issue 11- Nov 2019

includes the security of ATM cards, computer  denotes multiplication modulo


passwords, and electronic commerce. Passwords are In each round of the 8 rounds of algorithm, the
not good so far for the task due to their short range; following sequence of events is performed:
therefore, cryptography has wide future because this 1. Multiply Txt1 by the first sub-key.
technique can be able to with stand against the 2. Add Txtt2 and the second sub-key.
various attacks. The original information is converted 3. Add Txt3 and the third sub-key.
to cipher text using a secured key, this process is 4. MultiplyTxt4 by the fourth sub-key.
called encryption. The encoded data is recovered by 5. XOR the results of Steps 1 and 3.
the process of decryption. The block diagram of 6. XOR the results of Steps 2 and 4.
cryptographic model is shown in 7. Multiply the results of Step 5 by the fifth sub-key.
fig1. 8. Add the results of Steps 6 and 7.
9. Multiply the results of Step 8 by the sixth sub-key
10. Add the results of Step 7 and 9.
11. XOR the results of Steps 1 and 9.
12. XOR the results of Steps 3 and 9.
13. XOR the results of Steps 2 and 10.
Fig1: Block diagram of Cryptographic Model 14. XOR the results of Steps 4 and 10.
The computational process used for decryption
B . Secured communication of the cipher text is essentially the same as that used
for encryption of the plaintext. The only difference
Secured communication against network is compared with encryption is that during decryption,
increasing significantly with time. Our different 16-bit key sub-blocks are generated.
communication media should also be secure
and confidential. Cryptanalysis is the study
used to describe the methods of code-breaking
or cracking the code without using the security
information, usually used by hackers. For this
purpose, the following things can be done by
the sender/receiver.
 One can transmit the message secretly, so
that it can be saved from hackers.
 The sender ensures that the message
arrives to the desired destination.
 The receiver ensures that the received
message is in its original form and
coming from the authenticate person.
The basic block diagram of secured
communication is shown in
fig2

Fig3: Structure of IDEA


A. Key Generation
Fig2: Block diagram of Secured The 64-bit plaintext block is partitioned into four
Communication 16-bit sub-blocks, since all the algebraic
operations used in the encryption process operate
III. IMPLEMENTATION on 16-bit numbers. Another process produces
The functional representation of the encryption for each of the encryption rounds, six 16-bit key
process is shown in fig.3 the process consists of eight sub-blocks from the 128-bit key. Since a further
identical encryption steps followed by an output four 16-bit key-sub- blocks are required for the
transformation which is a half round. The structure of subsequent output transformation, a total of 52
the first round is shown in detail in fig3. (= 8 x 6 + 4) different 16-bit sub-blocks have to
The eight rounds are performed using the be generated from the 128-bit key. The 52 16-bit
combination of three algebraic operations: key sub-blocks which are generated from the
128-bit key are produced as follows:
 Bitwise exclusive OR (⊕).
 Addition modulo 2^16 (⊞).

ISSN: 2231-5381 http://www.ijettjournal.org Page 32


International Journal of Engineering Trends and Technology (IJETT) – Volume 67 Issue 11- Nov 2019

 First, the 128-bit key is partitioned into 24(=16), and multiplication modulo 24+1(=17).
eight 16-bit sub-blocks which are then There are 16 possible nibbles: 0000... 1111, which
directly used as the first eight key sub- represent 0... 15, for addition modulo 16. The 16
blocks. nibbles are thought of as 0001... 1111, 0000, which
represent 1... 15, 16, for multiplication modulo17.
 The 128-bit key is then cyclically Notice that 0000, which is 16, is congruent to -1
shifted to the left by 25 positions, after modulo 17. 0000 is it own inverse under
which the resulting 128-bit block is multiplication modulo 17.
again partitioned into eight 16-bit sub-
blocks to be directly used as the next
eight key sub-blocks.
 The cyclic shift procedure described
above is repeated until all of the
required 52 16-bit key sub-blocks have
been generated.

B. Encryption
Encryption is the process of converting plain text
into cipher text. The process consists of eight Fig5: Encryption Key Scheduling
identical encryption steps (known as encryption
rounds) followed by an output transformation.
The structure of the first round is shown in detail The 32-bit key, say
in fig4 11011100011011110011111101011001 is split into
eight nibbles 11011100 0110 1111 0011 1111 0101
1001. The first six nibbles are used as the sub keys
for round1.The remaining two nibbles are the first
two sub keys for round2, then the bits are shifted
cyclically 6places to the left and the new 32-bitstring
is split into eight nibbles that become then eight sub
keys. The first four of these nibbles are used to
complete the sub keys needed for round2, the
remaining four sub keys are used in round3.The
shifting and splitting process is repeated until all 28
sub keys are generated. Six sub keys are used in each
of the 4 rounds. The final 4 sub keys are used in the
fifth “half round” final transformation. As an
example, we will encrypt the plaintext message
1001110010101100 using the key
110111000110111100111111. The cipher text
message is 1011101101001011.
Fig4: Encryption in IDEA
The first four 16-bit key sub-blocks are combined
with two of the 16-bit plaintext blocks using addition C. Decryption
modulo 2^16, and with the other two plaintext blocks
Converting the cipher text into plain text is known as
using multiplication modulo 2^16 + 1. At the end of
decryption. It is a complete reverse process of
the first encryption round four 16-bit values are
encryption. The computational process used for
produced which are used as input to the second
decryption of the cipher text is essentially the same as
encryption round. The process is repeated in each of
that used for encryption of the plaintext. The only
the subsequent 7 encryption rounds. The four 16-bit
difference compared with encryption is that during
values produced at the end of the 8th encryption
decryption, different 16-bit key sub-blocks are
round are combined with the last four of the 52 key
generated. More precisely, each of the 52 16-bit key
sub-blocks using addition modulo 2^16 and
sub- blocks used for decryption is the inverse of the
multiplication modulo 2^16 + 1 to form the resulting
key sub-block used during encryption in respect of
four 16- bit cipher text blocks.The simplified IDEA
the applied algebraic group operation. Additionally,
encrypts a 16-bit block of plaintext to a 16-bit block
the key sub-blocks must be used in the reverse order
of cipher text. It uses a 32-bit key. The simplified
during decryption in order to reverse the encryption
algorithm consists of four identical rounds and a
process as shown in fig6.
“half round” final transformation. The simplified
algorithm mixes three algebraic operations on nibbles
(4-bitblocks): bitwise XOR, addition modulo

ISSN: 2231-5381 http://www.ijettjournal.org Page 33


International Journal of Engineering Trends and Technology (IJETT) – Volume 67 Issue 11- Nov 2019

increasing need for data protection. When PGP


(Pretty Good Privacy) was designed, the developers
were looking for maximum security. IDEA was their
first choice for data encryption. The fundamental
criteria for the development of IDEA were military
strength for all security requirements and easy
hardware and software implementation. In the future,
the DS-IDEA is going to be enhanced by including
more security operations that can strengthen the
confidentiality, integrity and availability of data that
are encrypted using this algorithm. We also plan to
apply this modified version of IDEA to other web-
based systems in e-business, e-commerce, and e-
learning environments with slightly different methods
of implementation.

References

[1] M. P. Leong, O. Y. H. Cheung, K. H. Tsoi and P. H. W.


Fig6: Decryption in IDEA Leong, "A bit-serial implementation of the international data
encryption algorithm IDEA," Proceedings 2000 IEEE
Symposium on Field-Programmable Custom Computing
Machines (Cat. No.PR00871), Napa Valley, CA, USA,
IV. Applications of IDEA 2000, pp. 122-131.
[2] International Data Encryption Algorithnm CS-627-Fall
 Today, there are hundreds of IDEA-based 2004 by How-Shen Chang
security solutions available in many market areas, [3] FPGA Implementation of International Data Encryption
ranging from Financial Services, and Algorithm-.IJESRT by MS.A.D.Chaudhari,Prof.S.D.Josh
Broadcasting to Government University of Pune, India
[4] https://www.nku.edu/~christensen/simplified%20IDEA%20
 The IDEA algorithm can easily be embedded in algorithm.pdf
[5] Introducing an Encryption Algorithm based on IDEA
any encryption software. Data encryption can be Osama Almasri , Hajar Mat Jani.
used to protect data transmission and storage. https://pdfs.semanticscholar.org/16e1/14914494b685187437
Typical fields are: 40776fd735fb673aee.pdf
[6] https://en.wikipedia.org/wiki/International_Data_Encryption
 Audio and video data for cable _Algorithm
TV, pay TV, video conferencing,
distance learning
 Sensitive financial and
commercial data
 Email via public networks
 Smart cards

V. Conclusion and Future Scope


IDEA is a well-known cipher that has been analyzed
by many researchers for the past decade, and, yet, no
attack against five or more of its 8.5 rounds has been
found. Due to its strength against cryptanalytic
attacks and due to its inclusion in several popular
cryptographic packages, IDEA is widely used. [4]
The Simplified IDEA algorithm is not intended to be
compared for efficiency or security with simplified
versions of DES or AES. The Simplified IDEA
algorithm is intended to help students understand the
IDEA algorithm by providing a version of IDEA that
permits examples to be worked by hand and to
provide a comparison of the method of IDEA with
the methods of DES and AES. As electronic
communications grow in importance, there is also an

ISSN: 2231-5381 http://www.ijettjournal.org Page 34

You might also like