Tech Papers
An example of application—elliptic curve cryptography
McGraw-Hill
Jean-Pierre Deschamps et alBook Excerpt
April 2009
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.
Reproduced from the book Hardware Implementation of Finite-Field Arithmetic Copyright © 2009 McGraw-Hill. Reproduced by permission of McGraw-Hill. Written permission from McGraw-Hill is required for all other uses. The book is intended for electronic design engineers working with embedded systems, system on chip and FPGA implementations, as well as EE students and researchers and provides information on electronic circuit synthesis. It can be ordered for $115 from the McGraw-Hill website.
Rate this Content
|
|
|
|
|
Navigate to related information
somecc
2/7/2012 4:25 AM EST
this not properly tells how the overall cryptographies system works??????only point doubling,point multiplication or addition is discussing.
Sign in to Reply