DNSCurve

From Wikipedia, the free encyclopedia
Jump to: navigation, search

DNSCurve is a proposed new secure protocol for the Domain Name System (DNS), designed by Daniel J. Bernstein.

Description[edit]

DNSCurve uses Curve25519[1] Elliptic curve cryptography to establish keys used by Salsa20, paired with the MAC function Poly1305, to encrypt and authenticate DNS packets between resolvers and authoritative servers. Public keys for remote authoritative servers are placed in NS records, so recursive resolvers know whether the server supports DNSCurve. Keys begin with the magic string uz5 and are followed by a 51-byte Base32 encoding of the server's 255-bit public key. E.g., in BIND format:

example.com. IN NS uz5bcx1nh80x1r17q653jf3guywz7cmyh5jv0qjz0unm56lq7rpj8l.example.com.

The resolver then sends to the server a packet containing its DNSCurve public key, a 96-bit nonce, and a cryptographic box containing the query. The cryptographic box is created using the resolver's private key, the server's public key, and the nonce. The response from the server contains a different 96-bit nonce and its own cryptographic box containing the answer to the query.

The cryptographic tools used in DNSCurve are the same used in CurveCP, a UDP-based protocol which is similar to TCP but uses elliptic-curve cryptography to encrypt and authenticate data. An analogy is that while DNSSEC is like signing a webpage with PGP, CurveCP and DNSCurve are like encrypting and authenticating the channel using SSL. Just as PGP-signed webpages can be sent over an encrypted channel using SSL, DNSSEC data can be protected using DNSCurve.

Security[edit]

DNSCurve uses 256-bit elliptic-curve cryptography, which NIST estimates to be roughly equivalent to 3072-bit RSA.[2] ECRYPT reports a similar equivalence.[3] It uses per-query public-key crypto (like SSH and SSL), and 96-bit nonces to protect against replay attacks. Adam Langley, security officer at Google, says "With very high probability, no one will ever solve a single instance of curve25519 without a large, quantum computer."[4]

Speed[edit]

Adam Langley has posted speed tests on his personal website showing curve25519, used by DNSCurve, to be the fastest among elliptic curves tested.[5] According to the NSA, elliptic curve cryptography offers vastly superior performance over RSA and Diffie-Hellman at a geometric rate as key sizes increase.[6]

Implementations[edit]

DNSCurve first gained recursive support in dnscache via a patch[7] by Matthew Dempsky. Dempsky also has a GitHub repository which includes Python DNS lookup tools and a forwarder in C.[8] Adam Langley has a GitHub repository as well.[9] There is an authoritative forwarder called CurveDNS[10] which allows DNS administrators to protect existing installations without patching. OpenDNS has released DNSCrypt[11] to protect the channel between OpenDNS's users and its recursive resolvers. Jan Mojžíš has released curveprotect,[12] a software suite which implements DNSCurve and CurveCP protection for common services like DNS, SSH, HTTP, and SMTP.

Deployment[edit]

OpenDNS, which has 50 million users, announced support for DNSCurve on its recursive resolvers on February 23, 2010.[13] Then on December 6, 2011, OpenDNS announced a new tool, called DNSCrypt.[14] DNSCrypt protects the channel between OpenDNS and its users. No equally large authoritative DNS providers have yet deployed DNSCurve.

See also[edit]

Notes[edit]

External links[edit]