Modular Reduction in GF(2n) without Pre-computational Phase
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
| Hi-index | 0.00 |
Modular reduction is the basic operation of cryptographic systems. The Barrett's Algorithm and Montgomery's Algorithm are widely used nowadays and they are both based on pre-computation. In the field of Elliptic Curve Cryptosystem (ECC) over GF(2^m), the reduction polynomials recommended by SEC have few items and the degree of second item is much less than that of the first one. Making use of this characteristic, the paper presents a new method to accelerate modular reduction without precomputation which speeds up modular reduction by 10-30 times over GF(2^m) and speeds up ECC point multiplication by 40%-50%. This algorithm has been implemented in a high-speed public-key cipher accelerator.