Elliptic curve Diffie–Hellman

原文地址：https://en.wikipedia.org/wiki/Elliptic_curve_Diffie%E2%80%93Hellman

 

Elliptic curve Diffie–Hellman

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Elliptic curve Diffie–Hellman (ECDH) is an anonymous key agreement protocol that allows two parties, each having an elliptic curve public-private key pair, to establish a shared secret over an insecure channel.^[1][2][3] This shared secret may be directly used as a key, or better yet, to derive another key which can then be used to encrypt subsequent communications using a symmetric key cipher. It is a variant of the Diffie–Hellman protocol using elliptic curve cryptography.

Key establishment protocol

Suppose Alice wants to establish a shared key with Bob, but the only channel available for them may be eavesdropped by a third party. Initially, the domain parameters (that is, in the prime case or in the binary case) must be agreed upon. Also, each party must have a key pair suitable for elliptic curve cryptography, consisting of a private key (a randomly selected integer in the interval ) and a public key (where ). Let Alice's key pair be and Bob's key pair be . Each party must have the other party's public key (an exchange must occur).

Alice computes . Bob computes . The shared secret is (the x coordinate of the point). Most standardized protocols based on ECDH derived a symmetric key from using some hash-based key derivation function.

The shared secret calculated by both parties is equal, because .

The only information about her private key that Alice initially exposes is her public key. So, no party other than Alice can determine Alice's private key, unless that party can solve the elliptic curve Discrete Logarithm problem. Bob's private key is similarly secure. No party other than Alice or Bob can compute the shared secret, unless that party can solve the elliptic curve Diffie-Hellman problem.

The public keys are either static (and trusted, say via a certificate) or ephemeral. Ephemeral keys are temporary and not necessarily authenticated, so if authentication is desired, authenticity assurances must be obtained by other means. Authentication is necessary to avoid Man in the Middle attacks. If one of Alice or Bob's public key is static then Man in the Middle attacks are thwarted. Static public keys provide neither forward secrecy nor key-compromise impersonation resilience, among other advanced security properties. Holders of static private keys should validate the other public key, and should apply a secure key derivation function to the raw Diffie–Hellman shared secret to avoid leaking information about the static private key. For schemes with more advanced security properties, see ECMQV and FHMQV.

While the shared secret may be used directly as a key, it is often desirable to hash the secret to remove weak bits due to the Diffie-Hellman exchange.^[4]

References

1. ^ NIST, Special Publication 800-56A, Recommendation for Pair-Wise Key Establishment Schemes Using Discrete Logarithm Cryptography
    
   , March, 2006.
2. ^ Certicom Research, Standards for efficient cryptography, SEC 1: Elliptic Curve Cryptography
    
   , Version 1.0, September 20, 2000.
3. ^ NSA Suite B Cryptography, Suite B Implementers' Guide to NIST SP 800-56A
    
   , July 28, 2009.
4. ^ Law, Laurie; Menezes, Alfred; Qu, Minghua; Solinas, Jerry; Vanstone, Scott (August 28, 1998). An Efficient Protocol for Authenticated Key Agreement
    
   . Certicom. Retrieved January 19, 2012.

v t e   Public-key cryptography Algorithms Benaloh Blum–Goldwasser Cayley–Purser CEILIDH Cramer–Shoup Damgård–Jurik DH DSA EPOC ECDH ECDSA EKE ElGamal signature scheme GMR Goldwasser–Micali HFE IES Lamport McEliece Merkle–Hellman MQV Naccache–Stern NTRUEncrypt NTRUSign Paillier Rabin RSA Okamoto–Uchiyama Schnorr Schmidt–Samoa SPEKE SRP STS Three-pass protocol XTR   Theory Discrete logarithm Elliptic curve cryptography RSA problem   Standardization ANS X9F1 CRYPTREC IEEE P1363 NESSIE NSA Suite B   Topics Digital signature OAEP Fingerprint PKI Web of trust Key size   v t e   Cryptography History of cryptography Cryptanalysis Cryptography portal Outline of cryptography   Symmetric-key algorithm Block cipher Stream cipher Public-key cryptography Cryptographic hash function Message authentication code Random numbers Steganography