Scribd
Upload
29 views17 pages

NSCG Unit 3

network security

Uploaded by

hari chandana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
29 views17 pages

NSCG Unit 3

network security

Uploaded by

hari chandana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 17
UNIT - Ill Public Key Cryptography Public Key Cryptography : RSA Ql What are the essential ingredients of a ‘Symmetric cipher ? Ans.: A public key encryption scheme has six ‘ingredients. Fig. Q1.1 shows public key cryptography. (Gee Fig. Q1.1 on next page) 1. Plaintext : It is input to algorithm and in a Teadable message or data, 2 Encryption algorithm : It performs various transformations on the plaintext Public and private keys : One key is used for encryption and other is used for decryption, 4 Ciphertest : This is the scrambled message Produced as output. It depends on the plaintext and the key. 5. Decryption algorithm : This algorithm accepts fhe ciphertext and the matching key and Produces the original plaintext. * The essential steps are the following : 1 Bach 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. This is the Public key. The companion key is kept private, 3. If Bob wishes to send a confidential message to Alicy Bob encrypts the message using Alc’s public key, 4 Alice decrypts the message using her Private key. 2 Explain requirement of public key ‘cryptography. Ans. : Requirements for public key cryptography It is computationally easy for a party B to generate a pair 2 It is computationally easy for a sender 4, generate the corresponding ciphertext ; C = EU, M) 3. It is computationally easy for the receiver decrypt the resulting ciphertext using the p key to recover the original message : ; M = DPR, ©) = DIPR, EPU, i) 4. It is computationally infeasible for an adver knowing the public key (PU,) to determine private key PRy. 5. It is computationally infeasible for an adversar knowing the public key (PU,) and a cipherte (©) to recover the original message (M). 3 Explain advantages and disadvantages Public key cryptography, Ans. : « Advantages of public key algorithm 1. Only the private key must be kept secret. 2 The administration of keys on a requires the presence of only a functional aa 4S opposed to an unconditionally A private/public key considerable long per ‘There are many relatively efficent Signature mechanisms asa result asymumetric-key schemes Tn a large network the number of keys may ‘be considerably smaller than in & symmetric-key Scenario, * Disadvantages of public key algorithm 1 Slower throughput rates than the best kno symmetric-key schemes, Large key size, No asymmetricke; be secure, Lack of extensive history, Pair remains unchanged fo iods of time, 7 'Y scheme has been proven i scanned witn Gamscanr work Security nd Ceyptogrephy BP Public Key Cryptography _ ‘Suresh Tomy | | | | | | | | Plaintext Encryption Decryption Plaintext input algorithm, algorithm output (2) Eneryption | Bob Bob's public key Bob's private key Plait Eneryption Decryption Plaintext input algorithm algorithm output {b) Authentication Fig. Q.4.4 Public key cryptography "P tecreacas puaucarions®. Ane ont er neeton we scanned witn Gamscanr : ies Se ea | &e | Symmetric key | Asymmetric key | rPtography | _ cryptography | One key for encryption | and oer key oe | decryption. | | Key exchange is not a | Probl | | Also called public key jon, encryption = key must be kept | One of te wa ge | the two key st be kept secret a keys. I | impute = | | 7- | Size of the resulting | Size of the result |_| encrypted text is usually | encrypted text is more i | |S As or less than the | hen fae ginal ng | original clear text size. text size. | |_otiginal lear = | 8 Cannot be used for | Can be used for digial | [digital signatures. | Signature Q.5 What are the Principles of public key typtosystems ? ESP [INTU + Nov.-16, Marks 3] Ans. : Principles : 1. Tt must be computationally easy to encipher or decipher a message given the appropriate key. 2. It must be computationally infeasible to derive the private key from the public key. 3. It must be computationally infeasible to determine the private key from a chosen plaintext attack. Q6 Explain exyptosystems. ‘Ans. : Use of publickey cryptosystems into three categories 1. Encryption /Decryption : The sender encrypts a message with the recipient's public key. gital signature : The sender "signs" a message 2 ie private key. Signing is achieved by a wilt applications for public-key Public Key Cryptography | ij i lied to the message |, ographic algorithm appl orto a smal block of data that is a function 9 the message. ns . xchange : Two sides cooperate to exchange * pn 1. Several different approaches are possible, involving the private key(s) of one or both parties. Q7 Explain the operation of RSA public key ‘encryption algorithm. Ans.:+ Public key cryptography means one Key i used for encryption and other key for decryption. The public key is accessed to all participants and private key is generated locally by each participant. * RSA is a block cipher in which the plaintext and ciphertext are integers between 0 and n 1 for some n. RSA algorithm is public key encryption type algorithm. In this algorithm, one user uses a Public key and other user uses a secret (private key) key. In the RSA algorithm each station independently and randomly chooses two large Primes p and q number and multiplies them to Produce n= p x q which is the modulus used in the arithmetic calculations of the algorithm, Key generation : 2) Pick two large prime numbers 2) Calculate n = p x g; 3) Calculate (0) = (p ~ 1) (q — 1; 4) Pick e, so that ged (¢, 4(n)) = 1, 1 mod P. ‘They then exchange their public values, Finally, Alice computes 8° =(g>)* mod p. Nowe Bob computes gb = (g8 ) mod P. Since g*P= = k, Alice and Bob now have a shared secret key k. Algorithm : * Select two numbers (1) prime number 92) aan integer that is a Primitive root of q * Suppose the users A and B wish to exchange a key, L User A select a random integer Xq iptic curve cryptosystems are for say, Difie-Hellman, there needs to be some thematical operation on two points in the set that fl always produce a point also in the set, ICC can be done with at least two types of arithmetic, each of which gives different definitions . GF (2°) arithmetic, which can be done with shifts and @ s. form a cryptographic system using elliptic gurves, we need to find a hard problem sponding to factoring the product of two primes or taking the discrete logarithm. Consider the equation Q = KP where Q P € Ep(a, b) nd K 0. « Eudlid’s algorithm says to write out the following : a=qyb+r, where = 0

You might also like