Scribd
Upload
129 views2 pages

Cryptography Assignment

The document outlines a cryptography assignment with various problems related to public key cryptography, elliptic curves, factorization methods, and S-Box operations. It includes tasks such as finding private exponents, computing elliptic curve points, executing Wiener’s Attack, and analyzing S-Box entries. Additionally, it discusses the piling up principle and bias analysis in cryptographic relations.

Uploaded by

Saakshi Chouhan
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
129 views2 pages

Cryptography Assignment

The document outlines a cryptography assignment with various problems related to public key cryptography, elliptic curves, factorization methods, and S-Box operations. It includes tasks such as finding private exponents, computing elliptic curve points, executing Wiener’s Attack, and analyzing S-Box entries. Additionally, it discusses the piling up principle and bias analysis in cryptographic relations.

Uploaded by

Saakshi Chouhan
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/ 2

CryptographyAssignment

jaydeep
November 2023

1. Suppose that the public keys are ⟨90581, 17993⟩ = ⟨N, e⟩. The continued fraction coefficient is [0, 5, 29, 4, . . . ]. Find
the private exponent.

2. Suppose that the public keys are ⟨64741, 42667⟩ = ⟨N, e⟩. The continued fraction coefficient is [0, 1, 1, 1, . . . ]. Find
the private exponent.
NOTE: Check that ed − 1 = kϕ(N ), all are integers.
3. Let the Elliptic Curve E : Y 2 = X 3 − 5X + 1 over the finite Field F17 . The points P1 := (0, 1) and P2 := (2, 13) are
on the curve. Compute the point P such that P = P1 + 2P2 .
4. Let the Elliptic Curve E : Y 2 = X 3 − 5X + 2 over the finite Field F17 . The points P1 := (1, 10) and P2 := (7, 2) are
on the curve. Compute the point P such that P = 4P2 , Q = P + P1 .
5. Let the public key of a RSA system is (7915, 12091) and the private key exponent is very low. Execute the Wiener’s
Attack and compute the factors of 12091.
7915
Consider the continued fraction of 12091 = [0, 1, 1, 1, 8, . . . ]
6. Take n = 4633 and B = {−1, 2, 3}. Note the b-smooth numbers as {67, 68, 69}. Find the factor of n.
7. Let n = 256961 has to be factored using the factor base B = {−1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31}. Choose the
appropriate B-smooth numbers b ≥ 500 and perform the factorization.
8. Using the factor base method with the factor base B = {2, 3, 5, 7, 11} compute the factors of n = 2043221. Find
which elements are among the list L is B-smooth, thereby finding the factors on n.

L = {1439, 2878, 3197, 3198, 3199, 3251, 3253}

9. Find the multiplicative inverse of X 4 +X +1 ∈ GF (28 ), considering the irreducible polynomial as X 8 +X 4 +X 3 +X +1.
Henceforth, find the S-Box entry of [1][3].
10. Compute the S-Box entry of [0][4].
11. Let the Message State is  
02 04 08 10
04 08 10 02
 
08 10 02 04
10 02 04 08
Find the 1st column of the Message state after MIX-COLUMN operation.
12. Let the round key at Round3 is

01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F 00

Find the round key for Rount4


13. State the piling up Principle. Follow the web link https://kevinliu.me/posts/linear-cryptanalysis/
14. Consider the 4 × 4S-BOX as below:

Input 0 1 2 3 4 5 6 7 8 9 A B C D E F
Output C 5 6 B 9 0 A D 3 E F 8 4 7 1 2

1
Find the biaseness of the relation X2 ⊕ X4 = Y3 and X4 = Y1 .
Using the biaseness and the substitution-permutation network (given in the figure), compute the probability of the
following relation
Y1 ⊕ Y4 ⊕ X3 ⊕ X4 ⊕ K01 ⊕ K03 ⊕ K13

You might also like