Professional Documents
Culture Documents
I.
II.
CRYPTOGRAPHY TECHNIQUES
INTRODUCTION
DES ALGORITHM
82
ISSN 2249-6343
International Journal of Computer Technology and Electronics Engineering (IJCTEE)
Volume 2, Issue 1
Table 1:
PC-1
Input
Initial Permutation
L0
R0
K1
L1=R0
R1=L0f(R0,K1)
K2
(2 mode more)
L4=R4
R4=L3f(R3,K4)
Output
Table 2:
PC-2
83
ISSN 2249-6343
International Journal of Computer Technology and Electronics Engineering (IJCTEE)
Volume 2 , Issue 1
01111000 01100110 01100110 which, after we apply the
permutation PC-2, becomes
K1=000110110000001011101111111111000111000001110
010
Table 3:
IP
84
ISSN 2249-6343
International Journal of Computer Technology and Electronics Engineering (IJCTEE)
Volume 2, Issue 1
That is, the output of the algorithm has bit 40 of the pre
Table 4
output block as its first bit, bit 8 as its second bit, and so on,
IP^ (-1)
until bit 25 of the pre-output block is the last bit of the
output.
Example: If we process all 4 blocks using the method
defined previously, we get, on the 4th round,
L4 = 10100010010111000000101111110100
R4= 01110111001000100000000001000101
We reverse the order of these two blocks and apply the
final permutation to
R4L4=
01110111001000100000000001000101101000100
10111000000101111110100
IP-1=010010011101100001100011001010000110001011
K1+E(R0)=1001010100011000010101010111011010000
0100100110001110000010
10111000111
this in hexadecimal format is 49D8632862D26382.
S1(B1)S2(B2)S3(B3)S4(B4)S5(B5)S6(B6)S7(B7)S8=0101110
This is the encrypted form of
01000 00101011 010110010111
M = 0123456789ABCDEF: namely,
The final stage in the calculation of f is to do a permutation
C = 49D8632862D26382.
P of the S-box output to obtain the final value of f: f =
Decryption is simply the inverse of encryption, following
P(S1(B1)S2(B2)...S8(B8)) P yields a 32-bit output from a
the same steps as above, but reversing the order in which
32-bit input by permuting the bits of the input block.
the sub-keys are applied
Example: From the output of the eight Sboxes:
CGS units, such as current in amperes and magnetic
S1(B1)S2(B2)S3(B3)S4(B4)S5(B5)S6(B6)S7(B7)S8=0101110
field in oersteds. This often leads to confusion because
01000 0010101101011001 0111
equations do not balance dimensionally. If you must use
we get f = 0010 0011010010101010100110111011
mixed units, clearly state the units for each quantity in an
R1=L0+f(R0,K1)= 1100110000000000110011001
equation.
111 1111+ 00100011010010101010100110111011
The SI unit for magnetic field strength H is A/m.
= 11101111010010100110010101000100
However,
if you wish to use units of T, either refer to
In the next round, we will have L2 = R1, which is the block
magnetic
flux density B or magnetic field strength
we just calculated, and then we must calculate R2 =L1 +
symbolized
as 0H. Use the center dot to separate
f(R1, K2), and so on for 4 rounds. At the end of the sixteenth
compound
units,
e.g., Am2.
round we have the blocks L4 and R4. We then reverse the
order of the two blocks into the 64-bit block R16L16 and
apply a final permutation IP-1 as defined by thefollowing
table
IV. CONCLUSION
In this paper, the DES algorithm has been analysed using
Xilinx tool and implemented on modelsim Spartan 3 kit.
Theresults are shown in the form of output waveforms .
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
Fig. 3: Output waveform for DES Encryption
85
ISSN 2249-6343
International Journal of Computer Technology and Electronics Engineering (IJCTEE)
Volume 2 , Issue 1
Subbarao V. Wunnava, Data Encryption Performance and
Evaluation Schemes Proceedings IEEE Southeastcon 2002, pp
234-238
[8] Xun Yi, Identity-Based Fault-Tolerant Conference Key
Agreement IEEE transactions on dependable and secure
computing, vol. 1, no. 3, July-September 2004, pp 170-178.
[9] M. Backes, Relating Symbolic and Cryptographic Secrecy IEEE
transactions on dependable and secure computing, vol. 2, no. 2,
April-June 2005, pp 109-123
[10] Elisa Bertino, An Efficient Time-Bound Hierarchical Key
Management Scheme for Secure Broadcasting IEEE transactions
on dependable and secure computing, vol. 5, no. 2, April-June
2008, pp 65-70
[11] Amandeep Singh, Manu Bansal, FPGA Implementation of
Optimized DES Encryption Algorithm on Spartan 3E 2010,
[12] O P Verma, Ritu Agarwal, Dhiraj Dafouti, Shobha Tyagi,
Peformance Analysis Of Data Encryption Algorithms 2011.
[7]
Nimmi Gupta
Email- nimmi.gupta877@gmail.com
Educational Qualifications:
Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal in 2010
Lakshmi Narain College of Technology, Bhopal(M.P)
Branch- VLSI Design Aggregate: 69%(Upto 2 Sem)
Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal in 2010
Sri Satya Sai Institute of Science and Technology, Sehore(M.P) In
Electronic & Communication branch.
86