Day 13: Elliptic Curve Cryptography: The Math Behind Keys

Elliptic Curve Cryptography

Elliptic Curve Cryptography (ECC) is the advanced mathematical framework that powers Bitcoin’s public and private keys. It’s like the "engine" under the hood, enabling secure, efficient, and tamper-proof transactions. Here’s how it works:

What is an Elliptic Curve?

• A Bitcoin uses the secp256k1 curve, defined by the equation:
  y2=x3+7y2=x3+7 (mod a massive prime number).

• Unlike smooth curves in math class, Bitcoin’s curve operates over a finite field, creating a grid of discrete points.

• Key property: If you draw a line through two points on the curve, it intersects exactly one other point. This enables cryptographic operations.

Why ECC in Bitcoin?

• Security: Solving the Elliptic Curve Discrete Logarithm Problem (ECDLP)—finding the private key from a public key—is computationally impossible with current technology.

• Efficiency: ECC keys are smaller than RSA keys (e.g., 256-bit vs. 3072-bit) but equally secure, saving bandwidth and storage.

Key Generation with ECC

1. Private Key: A random 256-bit number (e.g., a1b2c3...).

2. Public Key: Generated by "multiplying" the private key by a fixed base point (G) on the secp256k1 curve.

   • This "multiplication" isn’t arithmetic—it’s repeated point addition (e.g., 3G=G+G+G3G=G+G+G).

3. One-way function: Easy to compute the public key from the private key, but impossible to reverse the process.

---

Example

• Real-World Analogy:

  • Imagine a maze where the entrance is the base point (G). Your private key is the number of steps you take (e.g., 5 steps left, 3 right). The exit (public key) is easy to reach with the steps, but no one can guess your path from the exit alone.

• Code Snippet (Python ECC Operations):

from ecdsa import SigningKey, SECP256k1

# Generate a private key using secp256k1
private_key = SigningKey.generate(curve=SECP256k1)
private_key_hex = private_key.to_string().hex()
print("Private Key:", private_key_hex)

# Derive the public key (a point on the elliptic curve)
public_key = private_key.get_verifying_key()
public_key_hex = public_key.to_string().hex()
print("Public Key (Uncompressed):", "04" + public_key_hex)  # "04" indicates uncompressed format

• Output:

Private Key: 3d7d2a...  
Public Key: 04a3b7d...  

• Note: This is for educational purposes only. Use audited libraries like bitcoinlib for real wallets.

---

Exercise
Explore secp256k1 with an ECC Demo:

1. Visit Andrea Corbellini’s ECC Demo.

2. Set the curve to secp256k1 (or try a smaller curve for simplicity).

3. Pick a private key (e.g., 3) and "multiply" the base point (G) by it. Observe how the public key (3G) is calculated.

4. Share one observation about how points are added on the curve!

---

Engagement
Discuss: Why do you think Bitcoin chose ECC over RSA or other encryption methods?
Share your answer using #BitcoinBasics!

---

Key Takeaway
Elliptic Curve Cryptography is the genius behind Bitcoin’s security. By transforming a private key into a public key through irreversible mathematical operations, ECC ensures your funds stay safe while keeping the network lightweight and efficient.

Next: On Day 14, we’ll decode digital signatures—how you prove ownership without revealing your secrets! 🔐