A scalable and unified multiplier architecture for finite fields GF(p) and GF(2 m (2000)
| Venue: | and GF (2 m ). In Cryptographic Hardware and Embedded Systems — CHES 2000, LNCS |
| Citations: | 35 - 11 self |
BibTeX
@INPROCEEDINGS{Tenca00ascalable,
author = {A. F. Tenca and Ç. K. Koç},
title = {A scalable and unified multiplier architecture for finite fields GF(p) and GF(2 m},
booktitle = {and GF (2 m ). In Cryptographic Hardware and Embedded Systems — CHES 2000, LNCS},
year = {2000},
pages = {277--292},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF(p) and GF(2m). The unified architecture requires only slightly more area than that of the multiplier architecture for the field GF(p). The multiplier is scalable,which means that a fixed-area multiplication module can handle operands of any size,and also,the wordsize can be selected based on the area and performance requirements. We utilize the concurrency in the Montgomery multiplication operation by employing a pipelining design methodology. We also describe a scalable and unified adder module to carry out concomitant operations in our implementation of the Montgomery multiplication. The upper limit on the precision of the scalable and unified Montgomery multiplier is dictated only by the available memory to store the operands and internal results,and the module is capable of performing infinite-precision Montgomery multiplication in both types of finite fields. Key Words: Prime fields,binary extension fields,multiplication,Montgomery multiplication, scalability,hardware implementation.
