1 Pairings over elliptic curves in cryptography

Elliptic curve cryptography is presented as a practical answer to modern security needs, especially for developers who want stronger public-key systems with smaller numbers and lower resource costs than older approaches like RSA. The chapter introduces the basic idea that public key cryptography lets two parties safely create a shared secret over an open network, then use that secret with a fast symmetric cipher such as AES. It also explains the core roles of private keys and public keys in encryption, authentication, and digital signatures, showing how these tools support secure messaging, trusted documents, and anonymous or privacy-preserving transactions.

The chapter then builds toward the special value of elliptic curves in advanced applications. It emphasizes that elliptic curves are widely used in real systems such as payment protocols, web certificates, healthcare, supply chains, and blockchain environments. Beyond ordinary key exchange and signatures, the text highlights pairing-based elliptic curve methods, which make aggregate signatures and zero-knowledge proofs possible in compact and efficient ways. These pairing operations are described as mathematically deeper than basic curve arithmetic, but also as the key to many modern cryptographic constructions that are difficult or impossible to match with other techniques.

The chapter closes by framing the book’s purpose and audience. It acknowledges that the math can be challenging, but argues that readers do not need to be advanced mathematicians if they are willing to learn step by step. The book aims to guide developers through the necessary algebra, finite fields, and curve concepts so they can understand and implement secure cryptographic algorithms, including pairing-based schemes. In short, it sets expectations, motivates the subject with real-world use cases, and prepares the reader for a gradual path from basic elliptic curve ideas to the more sophisticated pairing methods used later in the book.

Conceptual elliptic curve over a finite field. Points are scattered in a multidimensional, astronomically large space.

Schematic of elliptic curve pairing with one point on base curve, one point on field extension curve, and the result in field extension values.

Creating a secret key by exchanging public keys

Processes involved with creating a digital signature

Process and data required to verify a digital signature

Aggregated digital signature signing combines multiple users’ public keys and individual signatures to create a single signature.

Aggregated digital signature verification process

Requirements involved to create zero-knowledge proof

The process of verifying a zero-knowledge proof

• Finite fields are sets with specific rules and a finite number of objects. The mathematics of finite fields determines how we manipulate elliptic curves.
• Elliptic curves over finite fields are good for cryptography because they use smaller numbers for the same level of security compared with other public key methods.
• Key exchange and digital signatures are straightforward, using elliptic curve mathematics through simple formulas. This makes programming the mathematics easy.
• Aggregation of many digital signatures using pairings over elliptic curves allows for smaller storage on a blockchain than other methods. This reduces the amount of data transmitted between peers, which decreases over all transaction time.
• Zero-knowledge proofs can certify knowledge of information without exposing that information. Zero-knowledge proofs use reduced amounts of data compared with other methods when using elliptic curve pairing mathematics.

FAQ