0% found this document useful (0 votes)
188 views6 pages

Practice Problems

This document contains practice problems related to cryptography algorithms including: 1) Analyzing pseudorandom number sequences generated by a linear feedback shift register 2) Performing encryption and decryption using RSA with example public and private keys 3) Calculating values for the Diffie-Hellman key exchange algorithm between two users 4) Finding the points on an elliptic curve with a given modulus 5) Determining the round keys for the first two rounds of DES and AES ciphers from example keys The document provides sample initialization vectors, public keys, and cipher keys to work through the cryptographic calculations.

Uploaded by

Harsha Vardhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
188 views6 pages

Practice Problems

This document contains practice problems related to cryptography algorithms including: 1) Analyzing pseudorandom number sequences generated by a linear feedback shift register 2) Performing encryption and decryption using RSA with example public and private keys 3) Calculating values for the Diffie-Hellman key exchange algorithm between two users 4) Finding the points on an elliptic curve with a given modulus 5) Determining the round keys for the first two rounds of DES and AES ciphers from example keys The document provides sample initialization vectors, public keys, and cipher keys to work through the cryptographic calculations.

Uploaded by

Harsha Vardhan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Practice Problems

 We will now analyze a pseudorandom number sequence generated


by a LFSR characterized by (c2 = 1,c1 = 0,c0 = 1).
1. What is the sequence generated from the initialization vector (s2 =1,
s1 =0, s0 =0)?
2. What is the sequence generated from the initialization vector (s2 =0,
s1 =1, s0 =1)?
3. How are the two sequences related?
Practice Problems
 Perform encryption and decryption using RSA Alg. for the following..
p=17; q = 11; e=7; Plaint text=88.

 Perform encryption and decryption using RSA Alg. for the following..
p=7; q = 11; e=17; Plain text=8.

 User Alice & Bob exchange the key using Diffie Hellman alg. Assume
g=5; p=83; X=6; Y=10. Find R1, R2, K.
Practice Problems
 User A and B use Diffie-Hellman key exchange a common prime
q=71 and a primitive root a=7.Calculate the following. If user A has
private key XA=5, what is A’s public key YA. If user B has private key
XB=12, what is B’s public key YB and what is shared secret key?

 Consider the elliptic curve E11(1,6);that is the curve is defined by


y2=x3+x+6 with a modules of P=11. Calculate all the points in
E11(1,6).
Practice Problems
 In DES algorithm find the key for ROUND 1 and ROUND 2 if the
key with parity bit is (AABB 0918 2736 CCDD)
Practice Problems
 In AES algorithm find the key for ROUND 1 and ROUND 2 if the
cipher key is (54 68 61 74 73 20 6D 79 20 4B 75 6E 67 20 46 75)

Sub Byte Table


Practice Problems

6 Dr. R.K.Mugelan, Asst. Prof. (Sr), SENSE, VIT

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy