AMJAD REHMAN A
•
• R S A
•
•
• ALGORITHMS CRYPTOGRAPHY
CRYPTOGRAPHIC KEYS
•
•
•
11001100 plaintext
01101100 key stream
10100000 Cipher text
•
•
•
•
•
•
•
•
for i = 0 to 255
do
S[i] = i;
T[i] = K[i mod keylen];
•
•
j = 0;
for i = 0 to 255
do
j = (j + S[i] + T[i]) mod 256;
Swap (S[i], S[j]);
•
i, j = 0;
for (int x = 0; x < byteLen; x++)
do
i = (i + 1) mod 256;
j = (j + S[i]) mod 256;
Swap (S[i], S[j]);
t = (S[i] + S[j]) mod 256;
k = S[t];
•
•
•
•
•
•
•
•
•
•
•
•
• SECURE SOCKETS LAYER
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
HTTP://WWW.DRIZZLE.COM/~ABOBA/IEEE/RC4_KSAPROC.PDF
•
HTTP://WWW.CS.RICE.EDU/~ASTUBBLE/WEP/WEP_ATTACK.PDF
•
HTTP://WWW.RSASECURITY.COM/RSALABS/TECHNOTES/WEP.HTML
•
HTTP://WWW.NCAT.EDU/~GROGANS/ALGORITHM_BREAKDOWN.HTM
•
HTTP://WWW.SCRIBD.COM/DOC/49849673/21/RC4-ALGORITHM