Scribd Logo
Upload

Welcome to Scribd!

  • 186 views

    Practical Cryptology, IT754A, 7,5hp: Instruction

    Uploaded by

    saeed khan
    This document provides instructions and tasks for a home examination in the course Practical Cryptology, IT754A. The examination consists of 7 tasks testing various cryptographic techniques including: RSA encryption and decryption, factoring using Pollard's p-1 method, the Chinese Remainder Theorem, the Diffie-Hellman key exchange, ElGamal encryption and signatures, the discrete logarithm problem, and elliptic curve cryptography. Students are instructed to complete the tasks individually and submit their written solutions as a PDF file.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Practical Cryptology, IT754A, 7,5hp: Instruction

    Uploaded by

    saeed khan
    186 views3 pages
    This document provides instructions and tasks for a home examination in the course Practical Cryptology, IT754A. The examination consists of 7 tasks testing various cryptographic techniques including: RSA encryption and decryption, factoring using Pollard's p-1 method, the Chinese Remainder Theorem, the Diffie-Hellman key exchange, ElGamal encryption and signatures, the discrete logarithm problem, and elliptic curve cryptography. Students are instructed to complete the tasks individually and submit their written solutions as a PDF file.

    Original Title

    Home Exam3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides instructions and tasks for a home examination in the course Practical Cryptology, IT754A. The examination consists of 7 tasks testing various cryptographic techniques including: RSA encryption and decryption, factoring using Pollard's p-1 method, the Chinese Remainder Theorem, the Diffie-Hellman key exchange, ElGamal encryption and signatures, the discrete logarithm problem, and elliptic curve cryptography. Students are instructed to complete the tasks individually and submit their written solutions as a PDF file.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    186 views3 pages

    Practical Cryptology, IT754A, 7,5hp: Instruction

    Uploaded by

    saeed khan
    This document provides instructions and tasks for a home examination in the course Practical Cryptology, IT754A. The examination consists of 7 tasks testing various cryptographic techniques including: RSA encryption and decryption, factoring using Pollard's p-1 method, the Chinese Remainder Theorem, the Diffie-Hellman key exchange, ElGamal encryption and signatures, the discrete logarithm problem, and elliptic curve cryptography. Students are instructed to complete the tasks individually and submit their written solutions as a PDF file.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    Practical Cryptology, IT754A, 7,5hp

    Home-take Examination 3

    Instruction
    ˆ This home-exam must be done individually. Copying others complete or partial
    work is strictly prohibited. You may, of course, discuss the problems with fellow
    students and/or teachers, but you should work on the solutions independently.

    ˆ The solutions should be written in a word processor program or a program like


    LaTeX and your work should be submitted as a PDF file. Your work should be
    well-structured and justified, as well as they should be easy to read.

    ˆ If you use a computer program to solve some tasks, a program listing together with
    the documentation of the program code should be provided as Appendix.

    1
    Examination tasks
    1. (a) Use Millar-Rabin test to show that n = 533213193 is not prime.
    (b) Alice use RSA to send the following message to Bob.
    3783 2249 504 3882 6486 3783 1791 77 3135 3783 1791 1180.
    During encryption, Alice used Bobs public key kpub = (n, e) = (6497, 223), the
    ordering of English alphabets a ↔ 31, b ↔ 32, . . . , z ↔ 56 and encrypts each
    letter separately. Oscar wants to attack the ciphertext without factorizing n.
    You task is also to find the plaintext without factoring n. (3 pts/task)
    2. The integer n = 4304177 is a product of two primes p and q.
    (a) Use Pollard-p − 1 method to factorize n. Compute also φ(n).
    (b) Choose a suitable encryption exponent e and find the corresponding decryption
    exponent d. Motivate your choice of e.
    (c) Use your key to encrypt a plaintext of your choice containing at least ten En-
    glish alphabets and the ordering a ↔ 01, b ↔ 02, . . . , z ↔ 26. The encryption
    should be done in a block of length three. (2 pts/task)
    3. In practice, it is customary to select a relatively small encryption exponent e that
    give rise to a relatively large decryption exponent d. Such a choice leads to a
    relatively fast encryption process, but a relatively slow decryption process. One
    way of speeding up the decryption process is using the Chinese Remainder Theorem
    (CRT).
    The process goes like this:
    Input: p, q, e, d and the ciphertext y = xe (mod n).
    Output: We want to compute plaintext x = y d (mod n)).
    ˆ Compute yp ≡ y (mod p) and yq ≡ y (mod q)
    ˆ Compute dp ≡ d (mod p − 1) and dq ≡ d (mod q − 1).
    d d
    ˆ Compute xp ≡ yp p (mod p) and xq ≡ yq q (mod q).
    ˆ Compute the inverse cp of q modulo p and the inverse cq of p modulo q
    ˆ Finally the ciphertext will be x = (qcp xp + pcq xq ) (mod n).

    Your task is to decrypt the ciphertext y = 34818 31433 13755 that was encrypted
    by RSA with public key kpub = (n, e) = (40633, 547). The ciphertext is generated
    by using English alphabets and the ordering a ↔ 01, b ↔ 02, . . . , z ↔ 26. Tasks to
    do.
    (a) Use Fermat’s Factorization method to factorize n. (2 pts)
    (b) Compute the decryption exponent d. (1 pt)
    (c) Follow the above procedure to decrypt the ciphertext by using the Chinese
    Remainder Theorem. (3 pts)
    4. (a) Find all the primitive elements of F∗37 . (1 pts)
    (b) Use Baby step-Giant step to solve the DLP
    39x ≡ 217 (mod 383).
    (2 pts)

    2
    (c) Use Pohlig-Hellman algorithm to solve the DLP

    7x ≡ 166 (mod 433).

    (3 pts)

    5. (a) Alice and Bob want to have a secrete four-digit access code for their Cryptology
    lab door that they share. They both decided to use Diffie-Hellman protocol
    with the public keys (p, g) = (9001, 13). Alice chose her private key to be
    x = 347. Find the private key Bob chooses so that the access code to the lab
    is 8962.
    (b) In the ElGamal cryptosystem, Alice and Bob use the prime number p = 17
    and a primitive root g = 3 modulo 17. Bob chooses his secret to be a = 6, so
    α = 36 (mod 17) = 15. Alice sends the ciphertext (β, y) = (7, 6). Determine
    the plaintext x. (3 pts/task)

    6. Let E be the elliptic curve y 2 = x3 + 2x + 3 (mod 19).

    (a) Show that the point (1, 5) lies on the curve. (1 pt)
    (b) Find an integer k such that k(1, 5) = (9, 3). (2 pts)
    (c) Use the Double-and-Add algorithm to compute 17(1, 5). (2 pts)

    7. For this task we consider the ELGamal signature scheme. We are given a prime
    p = 113 and a primitive element g = 67 ∈ Zp . You are given Bob’s private key
    d = 97 and the corresponding public key kpub = (p, g, β) where β = g d (mod p).

    (a) Calculate the ELGamal signature (r, s) and the corresponding verification
    forthe message x = 83 sent from Bob to Alice using ephemeral key kE = 59.
    (2 pts)
    (b) Alice thought that she received the messages (x1 , r1 , s1 ) = (38, 12, 77) and
    (x2 , r2 , s2 ) = (72, 92, 76) from Bob. Help Alice verify whether these messages
    originated actually from Bob. (3 pts)

    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