关键词: KOA方法 ECC 多项式乘法

Abstract:

The Polynomial-Basis Multiplier in the finite field is the key module to realizing ECC basic operations.The KOA method based on the recursive divide-and-conquer approach is presented in this paper.So multiplying two multi-precision operands becomes less complex by reducing the number of single-precisi on multiplications,which must be performed by replacing a multiplication with several additions.The experimental results show that the iterative application of Karatsuba＇s method for polynomial multiplications can reduce the chip area and energy needed to run elliptic curve cryptography.As a tradeoff,t the execution time is a little more but can be accepted.The prototype suits portable applications such as mobile devices.

Key words: Karatsuba-Offman-Algorithm;ECC;polynomial-basis multiplier