Elliptic curve cryptography

approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields

cryptographic algorithm for digital signatures

key agreement protocol involving two parties each with an elliptic-curve public-private key pair

In public-key cryptography, Edwards-curve Digital Signature Algorithm (EdDSA) is a digital signature scheme using a variant of Schnorr signature based on twisted Edwards curves. It is designed to be faster than existing digital signature schemes without sacrificing security. It was developed by a team including Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang. The reference implementation is public-domain software.

DNSCurve is a proposed secure protocol for the Domain Name System (DNS), designed by Daniel J. Bernstein. It encrypts and authenticates DNS packets between resolvers and authoritative servers.

Technique in cryptography

efficient algorithm to count points on elliptic curves

MQV (Menezes–Qu–Vanstone) is an authenticated protocol for key agreement based on the Diffie–Hellman scheme. Like other authenticated Diffie–Hellman schemes, MQV provides protection against an active attacker. The protocol can be modified to work in an arbitrary finite group, and, in particular, elliptic curve groups, where it is known as elliptic curve MQV (ECMQV).

family of elliptic curves of the form 𝑥²+𝑦²=1+𝑑𝑥²𝑦²

form of elliptic curve