Professional Documents
Culture Documents
Asymmetric Key Encryption - A Simple Case
Asymmetric Key Encryption - A Simple Case
1. 2.
In public key encryption mathematically algorithms produce the keys through one way function. In one way function an input cant be derived from output. Example: it is easy to make scrambled eggs, but impossible to retrieve whole eggs from the scrambled eggs. Keys used in Asymmetric key encryption are 128 bit, 256bit, 512bit. Algorithm used in Asymmetric key encryption are RSA(Ron Rives, Adi Shamir and Len Adleman ) etc.
1.
2.
3. 4. 5. 6.
7.
Select p,q p and q both prime Calculate n = p x q Calculate (n) ( p 1)(q 1) Select integer e gcd((n), e) 1; 1 e (n) 1 Calculate d d e mod (n) Public Key KU = {e,n} Private key KR = {d,n}
Plaintext: Ciphertext:
Ciphertext: Plaintext:
In public key encryption some elements of security are missing. Although we can be quite sure the message was not understood or read by a third party (Message Confidentiality) But No guarantee the sender really is the sender (no authentication of message) This mean the sender could deny ever sending the message (repudiation) And there is no assurance the message was not altered some how in transit. Example: message change to Buy Cisco@Rs.25 from sell Cisco @Rs.25. This suggests a potential lack of integrity in the system.