Scribd
Upload
24 views19 pages

CNS Unit 2

Cryptography Network Security

Uploaded by

Yash Tulsyan
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
24 views19 pages

CNS Unit 2

Cryptography Network Security

Uploaded by

Yash Tulsyan
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/ 19
tres Q.1 What is Abelian Group? List the axioms should obey for Abelian Group. Ans. Let (G, *) be a group. If a, b belongs to G and a * b = b * a, then the group is said to be Abelian or commutative group. The following axioms are obeyed for Abelian Group. (At) Closure (A2) Associative (A3) Identity element (Ad) Inverse element and (A5) Commutative Q.2 What are Rings? Ans. A ring R, sometimes denoted by {R,+, }.is @ set of eleménts withitwo binary operations, called addition and multiplication, such that for all a, b,c in R the following exioms are obeyed. (A1-A5) R is an Abelian group (M1) Closure under multiplication (M2) Associativity of multiplication (M3) Distributive law (M4) Commutative of multiplication (M5) Multiplicative identity (M6) No zero divisors Q.3 Define Fields? Ans. A field F, sometimes dénotediby {F.+, }. is a set of elements with two binary operations, called addition and,multiplicationpsuch that for all a, b, ¢ in F the following axioms are obeyed (A1-A6) and (M1-MB6) F is &\Ring for Integral Domain (M7) Multiplicative inverse Q.4 List the three classes of Polynomial Arithmetic. Ans. The three ¢lésses 6f Polynomial Arithmetic are : |. Ordinary polynomial arithmetic, using the basic rules of algebra . Polynomial arithmetic in which the arithmetic on the coefficients is performed modulo p: that is, the coefficients are in GF(p) Polynomial arithmetic in which the coefficients are in GF(p), and the polynomials are defined modulo a polynomial m(x) whose highest power is some integer n. SS By:Ruchi khetan (Assistant Professor) [email protected] tres Q.5 State Euler's theorem. Ans Euler’s theorem states that for every a and n that are relatively prime. a(n) 1 (mod n) Where 6(n) is a totient function Q.6 State Fermat's theorem. ‘Ans Fermat's theorem states the following. If p is prime and a is a positive integer not divisible by p, then ap-1 = 1 (mod p). Example: 2-7, p=19 7'8 = 1628413597910449 mod 19 =1 Alternative form of the theorem is: If p is prime and a is a positivelinteger, then a =a mod p Example: =3, 3° = 243 mod 5=3 mod 5 =3 Q7 Explain the principal of public keyscryptosystem in detail. Ans.Public key cryptography also alledias asymmetric cryptography. ‘+ It was invented by whitfield\Diffie and Martin Hellman in 1976. Sometimes this cryptography also ealled as Diffie-Helman Encryption. Public key, algorithmsjre based on mathematical problems which admit no efficient solution that aréyinherent in certain integer factorization, discrete logarithm and Elliptic curve relations. Public key Cryptosystem Principles: The concept Of, public key cryptography in invented for two most difficult problems of ‘Symmetric key encryption. 4.The Key Exchange Problem: The key exchange problem arises from the fact that communicating parties must somehow share a secret key before any secure communication can be initiated, and both parties must then ensure that the key remains secret. Of course, direct key exchange is not always feasible due to risk, inconvenience, and cost factors. 2. The Trust Problem: Ensuring the integrity of received data and verifying the identity of the source of that data can be very important. Means in the symmetric key cryptography system, receiver doesn’t know whether the message is coming for particular sender. SS By:Ruchi khetan (Assistant Professor) [email protected] tres ‘* This public key cryptosystem uses two Keys as pair for encryption of plain text and Decryption of cipher text These two keys are names as “Public key” and “Private key”. The private key is kept sacret where as public key is distributed widely. ‘A message or text data which is enerypted with the public Key can be decrypted only with the corresponding private-key This two key system very useful in the areas of confidentiality (secure) and authentication A public-key encryption scheme has six ingredients Plaintext | This is the readable message or data that is fed into thelgotithm ainput. Encryption algorithm Public key The encryption algorithm performs various transformationsion the plaintext. This is @ pair of keys that have been selected so What if one is used for encryption, the other is used for decryption. The exact transformations Private | performed by the algorithm depend on'the public 6 private key that is provided key as input This is the scrambled messaggyproduced aS output. It depends on the plaintext and the key. For a given message, two different keys will produce two different cipher texts. Decryption | This algorithm accepts the ipher text and the matching key and produces the algorithm | original plaintext Cipher Text Public key cryptography for providing confidentiality (secrecy) Alice Alice's public ey Tra ciphertext Y=EIPU,X) By:Ruchi khetan (Assistant Professor) [email protected] ental ‘Q8. Discuss Conventional vs public key encryption? Ans. Conventional encryption Public key encryption ‘Same algorithm with the same key is used for encryption and decryption One algorithm is used for encryption and decryption with a pair of keys, one for encryption and one for decryption ‘Sender and receiver must share the algorithm and the ke Sender and receiver must each have one of the matched pair of ke) Key must be kept seoret (One of the two keys mustibe kephsecrat Knowledge of algorithm + sample of ciphertext must be insufficient to determine the Ke Knowledge of algorithm, + one of the key + samples of ciphertext must be insufficient tovgétermine the other ke Itmust be impossible or at least impractical to decipher a message if no other information is available. It must be impossible of at least impractical to devipher a message if no othet information is available. Q.9 Explain RSA in detail Ans. # Itis the most common public key algorithm This RSA name is get from its inventors fitstileter (Rivest (R), Shamir (S) and Adleman (A)) in the year 1977 The RSA scheme is a bI6¢k, cipher in which the plaintext & ciphertext are integers between 0 and n-1 for some ‘n") A typical size for ‘n“lis 1024 bits ot 309 decimal digits. That is, n is less than 2"* Description of the Algorithm: ‘© RGA algotithm Uses an expression with exponentials. + “Yn RSA plaintext is encrypted in blocks, with each block having a binary value less than some number n. that is, the block size must be less than or equal to Loga(n) RSA tises {Wo exponents ‘e” and ‘d’ where e-> public and d>private. Encryption and decryption are of following form, for some PlainText *M’ and CipherText block ‘C” C=MF mod n| M=C! mod n M=C* mod = (M* mod n)* mon n =(M*)* mod n= M* mod n. SS By:Ruchi khetan (Assistant Professor) [email protected] tres Both sender and receiver must know the value of n. The sender knows the value of *e” & only the reviver knows the value of “d” thus this is a public key encryption algorithm with a Public key PU={e, n} Private key PR={d, n} The ingredients of RSA algorithm are as follows: 1. p.q, two prime numbers private, chosef 2. n= pq public, calétilated 3. e, with god (e , o(n))=1 , Where 1 is refer as discrete logarithm or index of b for the base a, mod P. The Value denoted 2s ind »(b) Algorithm for Diffie-Hellman Key Exchange: Step 1> two public known numbers q, > Prime number > primitive root of q and aq. Step 2 if A & B users wish to exchange a key a) User A select a random integer Xa two calculation produce identical results Xa K= (Ya) modq Xs = (0%® mod Xe Ke ©) moda (yye know that Yer © mod x, = (0X8 "mod q =(e**) mod q % = (e mod q ) mod q % - = (Ya Yao m (va) mod q (We know that ai mod d The result is that the two sides have exchanged a éecretkey. Select Global public Elements q7>Prime number a >primitive Root of q ‘User A key Generation User B key Generation SelectPrivateXs, Xa 0, g odd, so that (n-1)=2'g 2. Select @ random integer a, 1

You might also like