CRYPTOGRAPH Y

UNIT 3

Model of Cryptographic Systems

Model of Cryptographic Systems

using this model requires us to:

1.
2. 3. 4.

design a suitable algorithm for the security transformation generate the secret information (keys) used by the algorithm develop methods to distribute and share the secret information specify a protocol enabling the principals to use the transformation and secret information for a security service

Some Basic Terminology

plaintext - original message ciphertext - coded message cipher - algorithm for transforming plaintext to ciphertext key - info used in cipher known only to sender/receiver encipher (encrypt) - converting plaintext to ciphertext decipher (decrypt) - recovering plaintext from ciphertext cryptography - study of encryption principles/methods cryptanalysis (codebreaking) - study of principles/ methods of deciphering ciphertext without knowing key cryptology - field of both cryptography and cryptanalysis

Encryption and decryption

How does cryptography work?

A cryptographic algorithm, or cipher, is a mathematical function used in the encryption and decryption process. A cryptographic algorithm works in combination with a keya word, number, or phraseto encrypt the plaintext. The same plaintext encrypts to different cipher text with different keys. The security of encrypted data is entirely dependent on two things:

the strength of the cryptographic algorithm the secrecy of the key.

A cryptographic algorithm, plus all possible keys and all the protocols that make it work comprise a cryptosystem.

Types of Cryptography

Basically there are two types of encryption techniques used in cryptography for securing the message. They are:
Symmetric
Caesar

/Conventional/ Secret-key key cryptography

Cipher, DES

Asymmetric/public
RSA

Symmetric & Asymmetric Encryption

Symmetric Encryption

Asymmetric Encryption

Public key Cryptography

Public-key cryptography is asymmetric, involving the use of two separate keys. Public-key algorithms are based on mathematical functions rather than on substitution and permutation. It is computationally infeasible to determine the decryption key given only knowledge of the cryptographic algorithm and the encryption key. Either of the two related keys can be used for encryption, with the other used for decryption.

Terms related to public key cryptography

Asymmetric Keys Two related keys, a public key and a private key, that are used to perform complementary operations Public Key Certificate A digital document issued and digitally signed by the private key of a Certification Authority that binds the name of a subscriber to a public key. Public Key (Asymmetric) Cryptographic Algorithm A cryptographic algorithm that uses two related keys, a public key and a private key. The two keys have the property that deriving the private key from the public key is computationally infeasible. Public Key Infrastructure (PKI) A set of policies, processes, server platforms, software and workstations used for the purpose of administering certificates and public-private key pairs, including the ability to issue, maintain, and revoke public key certificates.

Working of Public Key Cryptography

The essential steps are the following: 1. Each user generates a pair of keys to be used for the encryption and decryption of messages. 2. Each user places one of the two keys in a public register or other accessible file. This is the public key. The companion key is kept private. 3. If sender wishes to send a confidential message to Alice, Bob encrypts the message using Alices public key. 4. When receiver receives the message, he/she decrypts it using her private key. No other recipient can decrypt the message because only receiver knows his/hers private key.

Difference between the two approach

RSA Algorithm

Developed in 1977 by Ron Rivest, Adi Shamir, and Len Adleman at MIT and first published in 1978 RSA algorithm is for public-key cryptography. RSA is the earliest algorithm recognized for encryption. RSA is commonly used in e- commerce protocols, and is widely accepted to be secure. As the RSA algorithm is asymmetric algorithm, therefore it involves two keys private and public keys. To generate these keys there is an algorithm, which is as follows:

RSA Algorithm

Select two distinct prime numbers p and q. Once the integer has been selected, compute n = p*q. Compute (pq) = (p 1)*(q 1). Select an integer e such that 1 < e < (p, q), and e and (p, q) share no divisors other than 1 (i.e., e and (p, q) are co-prime). Determine d which satisfies the equation de = 1 (mod (n)) Choose public key = (n, e), private key = (d, e) For encryption: c= me mod n For decryption: m= cd mod n

RSA Algorithm: Example

1. Selecting prime numbers as p=11, q=3. 2. Calculating n = p*q = 11*3 = 33, Calculating = (p-1)*(q-1) = 10*2 = 20 3. Selecting e=3 4. Computing d such that de 1 (mod )

On simply testing various integers (d = 1, 2, ...) gives d = 7, Therefore,

5. Public Key = (n, e) = (33, 3), Private Key = (n, d) = (33, 7). To encrypt any message m, say m = 7, putting in the encrypting equation, c = me mod n = 73 mod 33 = 343 mod 33 = 13. Hence the cipher text c = 13. To check decryption we put the value of cipher text in equation, we get

Digital Signature

A digital signature is an e-signature mathematical technique that is used to authenticate the identity of the sender of a message and also to make sure that the original content of the message that has been sent are not modified. Digital signatures can easily be transported, cannot be reproduced by someone else, and can automatically be time-stamped. A digital signature provides recipient the reason to accept that message was created and was send by a known sender, and also that it was not altered during transmission. Digital signatures utilize asymmetric cryptography

Digital Signature

Digital signatures enable "authentication" of various digital messages, giving surety to the recipient of digital message of both the identity of the sender as well as the integrity of the received message. A digital signature can be obtained either by the using hash code or without Depending whether the user is looking for confidentiality or authentication, the digital signature can be produce either by using the public key or the private key for the purpose of encryption.

Digital Signature

A digital signature consists of three different algorithms: A key generation algorithm that chooses a private key uniformly and randomly from a set of all possible private keys. The algorithm generates the private key and its corresponding public key. A signing algorithm which when given a message and a private key (or public key), produces a digital signature. A signature verifying algorithm which when given a message, public key (or private key) and a digital signature, either accepts or rejects the message's authenticity The digital signatures involve two processes Signing & Verification

Digital Signature: Process