Abstract
This paper describes an efficient FPGA implementation for modular multiplication in the finite field GF(2m) that is suitable for implementing Elliptic Curve Cryptosystems. We have developed a systolic array implementation of a Montgomery modular multiplication. Our solution is efficient for large finite fields (m=160-193), that offer a high security level, and it can be scaled easily to larger values of m. The clock frequency of the implementation is independent of the field size. In contrast to earlier work, the design is not restricted to field representations using irreducible trinomials, all one polynomials or equally spaced polynomials.
Keywords
Cite this article
@article{cai-1516,
author = {Nele Mentens and Siddika Berna Ӧrs and Bart Preneel and Joos Vandewalle},
title = {An FPGA Implementation of a Montgomery Multiplier Over GF(2m)},
journal = {Computing and Informatics},
volume = {23},
number = {5-6},
pages = {487--499},
year = {2004},
issn = {1335-9150},
url = {https://cai.type.sk/content/2004/5-6/an-fpga-implementation-of-a-montgomery-multiplier-over-gf-2m/}
}
TY - JOUR AU - Nele Mentens AU - Siddika Berna Ӧrs AU - Bart Preneel AU - Joos Vandewalle TI - An FPGA Implementation of a Montgomery Multiplier Over GF(2m) JO - Computing and Informatics VL - 23 IS - 5-6 SP - 487 EP - 499 PY - 2004 SN - 1335-9150 UR - https://cai.type.sk/content/2004/5-6/an-fpga-implementation-of-a-montgomery-multiplier-over-gf-2m/ KW - Elliptic Curve Cryptosystems KW - FPGA KW - Montgomery's multiplication method KW - systolic array ER -
Mentens, N., Ӧrs, S. B., Preneel, B., & Vandewalle, J. (2004). An FPGA Implementation of a Montgomery Multiplier Over GF(2m). Computing and Informatics, 23(5-6), 487–499. https://cai.type.sk/content/2004/5-6/an-fpga-implementation-of-a-montgomery-multiplier-over-gf-2m/