An example of application—elliptic curve cryptography
This chapter excerpted from Hardware Implementation of Finite-Field Arithmetic, gives an example of finite-field application—namely, the implementation of the scalar product (point multiplication) over an elliptic curve. It is the basic computation primitive of elliptic curve cryptography.
The book, written by Jean-Pierre Deschamps, José Luis Imaña and Gustavo D. Sutter describes algorithms and circuits for executing finite-field operations, including addition, subtraction, multiplication, squaring, exponentiation and division.
Please disable any pop-up blockers for proper viewing of this Whitepaper.