Mathematical background

0Citations
Citations of this article
565Readers
Mendeley users who have this article in their library.

Abstract

In this chapter, the author reviews the essential mathematical concepts, definitions, and properties required for the formal description of bilinear pairings. Fields, and, more particularly, finite fields, together with elliptic curves, play a fundamental role in the construction of pairings. In pairing-based cryptography, one can consider finite fields of small characteristic or finite fields of a large prime characteristic. The computation of pairings relies on the arithmetic of finite fields. In particular, several important optimizations in a pairing execution are based on Fermat's little theorem. The choice of the multiplication algorithm is adapted to the bit size of the operands or the targeted device.

Cite

CITATION STYLE

APA

Beuchat, J. L., Mrabet, N. E., Fuentes-Castañeda, L., & Rodríguez-Henríquez, F. (2017). Mathematical background. In Guide to Pairing-Based Cryptography (p. 2). CRC Press. https://doi.org/10.2307/j.ctvjhzq9s.5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free