Scribd Logo
Upload

Welcome to Scribd!

  • Guilbert Nicanor A. Atillo - DIT: Question: What Do You Propose To Modify Diffie - Hellman Key Exchange Algorithm?

    Uploaded by

    Guilbert Nicanor Atillo
    8 views1 page
    The document proposes modifying the Diffie-Hellman key exchange algorithm to increase security by implementing a more robust random number generator. Specifically, it suggests using the R250 algorithm, which is a generalized feedback shift register (GFSR) that generates pseudorandom numbers with a long period of almost 2^250. The block diagram shows Alice and Bob independently generating random numbers using R250, then exchanging public values and computing a shared secret key based on their private random numbers and the received public values. This aims to prevent man-in-the-middle attacks on the standard Diffie-Hellman key exchange.

    Original Description:

    hgfhjgjhgjkhkj

    Original Title

    Diffie-Hellman

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document proposes modifying the Diffie-Hellman key exchange algorithm to increase security by implementing a more robust random number generator. Specifically, it suggests using the R250 algorithm, which is a generalized feedback shift register (GFSR) that generates pseudorandom numbers with a long period of almost 2^250. The block diagram shows Alice and Bob independently generating random numbers using R250, then exchanging public values and computing a shared secret key based on their private random numbers and the received public values. This aims to prevent man-in-the-middle attacks on the standard Diffie-Hellman key exchange.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Guilbert Nicanor A. Atillo - DIT: Question: What Do You Propose To Modify Diffie - Hellman Key Exchange Algorithm?

    Uploaded by

    Guilbert Nicanor Atillo
    The document proposes modifying the Diffie-Hellman key exchange algorithm to increase security by implementing a more robust random number generator. Specifically, it suggests using the R250 algorithm, which is a generalized feedback shift register (GFSR) that generates pseudorandom numbers with a long period of almost 2^250. The block diagram shows Alice and Bob independently generating random numbers using R250, then exchanging public values and computing a shared secret key based on their private random numbers and the received public values. This aims to prevent man-in-the-middle attacks on the standard Diffie-Hellman key exchange.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Guilbert Nicanor A.

    Atillo – DIT

    Question: What do you propose to modify Diffie -Hellman Key Exchange Algorithm?
    Provide the block diagram.

    Answer:

    In the real world, the Diffie-Hellman key exchange is rarely used by itself. The main reason
    behind this is that it provides no authentication, which leaves users vulnerable to man-in-the-
    middle attacks. These attacks can take place when the Diffie-Hellman key exchange is
    implemented by itself, because it has no means of verifying whether the other party in a
    connection is really who they say they are. Without any form of authentication, users may
    actually be connecting with attackers when they think they are communicating with a trusted
    party. This means that entity authentication needs to be provided by other means. So, by itself
    Diffie- Hellman is usually not secure; only if the key pairs are static and the public keys are
    trusted can Diffie- Hellman be used to create a fully secure protocol. For this reason, the Diffie-
    Hellman key exchange is generally implemented alongside some means of authentication.

    To prevent more attacks in the connection, I would like to propose for a more robust used of
    random generator known as R250 algorithm, a generalized feedback shift register
    (GFSR).The GFSRs are determined by two parameters, a length and an offset. R250 is actually
    GFSR(250,103), indicating a length of 250 and an offset of 103. R250 has a period of almost
    2^250. Implementation of the algorithm is straightforward, and p = 250 words of memory are
    needed to store the 250 latest random numbers. A new term of the sequence can be generated
    by a simple exclusive - or operation.

    xn = xn -103 xn -103

    u n = xn/232
    Block Diagram
    P and G are public
    ALICE BOB
    1
    1 Exchange Prime (P) and Generator (G) Exchange Prime (P) and Generator (G)
    1
    2 R250 pseudorandom number generator
    R250 pseudorandom number generator
    1 generates random number
    generates random number
    1
    3 Compute YA = GXn (mod P)
    1 Compute YB = GXn (mod P)

    4 Receives YB Receives YA
    1

    5 Secret key = YB Xn (mod P) Secret key = YA X n (mod P)


    1

    You might also like