Scribd Logo
Upload

Welcome to Scribd!

  • 130 views

    El Gamal PDF

    Uploaded by

    avi0341
    The ElGamal public key encryption algorithm works as follows: 1) Alice generates a public/private key pair based on a prime number p, generator α, and private exponent d. 2) Bob selects a random integer k, computes encrypted values r and t, and sends the ciphertext (r,t) to Alice. 3) Alice decrypts the ciphertext using her private key to recover the original plaintext message. The security of ElGamal depends on the difficulty of computing discrete logs in a large prime modulus, unlike RSA which relies on factoring.

    Copyright:

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

    El Gamal PDF

    Uploaded by

    avi0341
    130 views2 pages
    The ElGamal public key encryption algorithm works as follows: 1) Alice generates a public/private key pair based on a prime number p, generator α, and private exponent d. 2) Bob selects a random integer k, computes encrypted values r and t, and sends the ciphertext (r,t) to Alice. 3) Alice decrypts the ciphertext using her private key to recover the original plaintext message. The security of ElGamal depends on the difficulty of computing discrete logs in a large prime modulus, unlike RSA which relies on factoring.

    Original Title

    el-gamal.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The ElGamal public key encryption algorithm works as follows: 1) Alice generates a public/private key pair based on a prime number p, generator α, and private exponent d. 2) Bob selects a random integer k, computes encrypted values r and t, and sends the ciphertext (r,t) to Alice. 3) Alice decrypts the ciphertext using her private key to recover the original plaintext message. The security of ElGamal depends on the difficulty of computing discrete logs in a large prime modulus, unlike RSA which relies on factoring.

    Copyright:

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

    El Gamal PDF

    Uploaded by

    avi0341
    The ElGamal public key encryption algorithm works as follows: 1) Alice generates a public/private key pair based on a prime number p, generator α, and private exponent d. 2) Bob selects a random integer k, computes encrypted values r and t, and sends the ciphertext (r,t) to Alice. 3) Alice decrypts the ciphertext using her private key to recover the original plaintext message. The security of ElGamal depends on the difficulty of computing discrete logs in a large prime modulus, unlike RSA which relies on factoring.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    The ElGamal Public Key Encryption Algorithm Bob encrypts a short message M (M < pA) and sends it to

    Alice like this:


    The ElGamal Algorithm provides an alternative to the RSA i) Bob chooses a random integer k (which he keeps
    for public key encryption. secret).
    1) Security of the RSA depends on the (presumed) k k
    ii) Bob computes r A (mod pA) and t A M (mod
    difficulty of factoring large integers.
    pA), and then discards k.
    2) Security of the ElGamal algorithm depends on the Bob sends his encrypted message (r, t) to Alice.
    (presumed) difficulty of computing discrete logs in a
    large prime modulus.

    ElGamal has the disadvantage that the ciphertext is twice as When Alice receives the encrypted message (r, t), she
    d
    long as the plaintext. decrypts (using her private key dA) by computing t r A.
    It has the advantage the same plaintext gives a different Note tr
    dA k
    A M (A )
    k dA
    (mod pA)
    ciphertext (with near certainty) each time it is encrypted. dA k k dA
    (A ) M (A ) (mod pA)
    M (mod pA)
    Alice chooses
    i) A large prime pA (say 200 to 300 digits), Even if Eve intercepts the ciphertext (r, t), she cannot
    ii) A primitive element A modulo pA, perform the calculation above because she doesnt know dA.
    iii) A (possibly random) integer dA with 2 dA pA 2. dA
    A A (mod pA), so dA LA (A)
    Alice computes
    dA Eve can find dA if she can compute a discrete log in the large
    iv) A A (mod pA).
    prime modulus pA, presumably a computation that is too
    difficult to be practical.
    Alices public key is ( pA, A, A ). Her private key is dA.

    Caution: Bob should choose a different random integer k


    for each message he sends to Alice.
    If M is a longer message, so it is divided into blocks, he
    should choose a different k for each block.
    Say he encrypts two messages (or blocks) M1 and M2, using
    the same k, producing ciphertexts
    (r1, t1) = (Ak, Ak M1), (r2, t2) = (Ak, Ak M2 ).

    Then t2 t11 M2 M11 (mod p), M2 t2 t11M1 (mod p). If


    Eve intercepts both ciphertext messages and discovers one
    plaintext message M1, she can compute the other plaintext
    message M2.

    Example: Alice chooses pA = 107, A = 2, dA = 67, and she


    computes A = 267 94 (mod 107). Her public key is
    ( pA, A, A ) = (2,67,94), and her private key is dA = 67.

    Bob wants to send the message "B" (66 in ASCII) to Alice.


    He chooses a random integer k = 45 and encrypts M = 66 as
    (r, t) = (Ak, Ak M) ( 245, 9445 66) (28, 9) (mod 107). He
    sends the encrypted message (28, 9) to Alice.

    Alice receives the message (r, t) = (28, 9), and using her
    private key dA = 67 she decrypts to
    dA
    tr = 9 2867 9 2810667 9 43 66 (mod 107).

    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