Blockchain & Cryptocurrency Glossary

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.

  • search-icon Clear Definitions
  • search-icon Practical
  • search-icon Technical
  • search-icon Related Terms

Elliptic Curve

1 min read
Pronunciation
[ih-lip-tik kurv]
Analogy
Imagine a special, uniquely shaped playground slide (the elliptic curve). You can define a way to 'add' two points on the slide to find a third point, also on the slide. This 'addition' has unique mathematical properties that are hard to reverse, making it useful for creating cryptographic secrets. It's like a mathematical playground for generating strong keys.
Definition
A specific type of algebraic curve defined by a mathematical equation, whose points can be used to perform cryptographic operations. Elliptic Curve Cryptography (ECC) leverages the properties of these curves to create efficient and secure public-key cryptosystems.
Key Points Intro
Elliptic curves provide the mathematical foundation for modern, efficient public-key cryptography.
Key Points

Defined by an equation, typically of the form y^2 = x^3 + ax + b (over finite fields in cryptography).

Points on the curve, along with a 'point at infinity', form an algebraic group with a defined 'addition' operation.

Elliptic Curve Cryptography (ECC) can provide equivalent security to older cryptosystems (like RSA) with much smaller key sizes.

Used in digital signatures (ECDSA), key exchange (ECDH), and various blockchain technologies.

Example
Bitcoin and Ethereum use the elliptic curve secp256k1 for generating public/private key pairs and for digital signatures (ECDSA), enabling secure transactions with relatively short keys.
Technical Deep Dive
In ECC, a private key is typically a random integer 'k'. The corresponding public key is derived by performing scalar multiplication of a standard base point 'G' (also called a generator point) on the curve by 'k', resulting in a point P = kG. The security of ECC relies on the difficulty of the Elliptic Curve Discrete Logarithm Problem (ECDLP): given points P and G, it is computationally infeasible to find the integer k. Operations like point addition and point doubling are fundamental to performing this scalar multiplication efficiently. Different curves (e.g., secp256k1, Curve25519, NIST P-256) offer varying performance and security characteristics.
Security Warning
The security of ECC depends on choosing appropriate curves and parameters, and implementing the cryptography correctly. Weak curves or flawed implementations can be vulnerable to attacks. Some older NIST curves have faced scrutiny regarding their selection process and potential (though unproven) weaknesses.

Elliptic Curve - Related Articles

No related articles for this term.