VLSI Implementation of Inversion Circuits on Finite Field
Hen H · Microcomputer Information · 2008
On , through Extended Euclidean algorithm for binary polynomials, this paper presents a modular inversion circuit on affine coordinates. Base on Fermat's theorem, we designed a modular inversion circuit on standard projective coordinates, which can reuse multiplication and squaring modules. Comparison and analysis on their performances has been made. These circuits hold practical value, and the second one has been embedded in an ECC chip.