Proceedings of the Korea Society for Industrial Systems Conference (한국산업정보학회:학술대회논문집)
- 2002.06a
- /
- Pages.190-194
- /
- 2002
New Multiplier using Montgomery Algorithm over Finite Fields
유한필드상에서 몽고메리 알고리즘을 이용한 곱셈기 설계
Abstract
Multiplication in Galois Field GF(2/sup m/) is a primary operation for many applications, particularly for public key cryptography such as Diffie-Hellman key exchange, ElGamal. The current paper presents a new architecture that can process Montgomery multiplication over GF(2/sup m/) in m clock cycles based on cellular automata. It is possible to implement the modular exponentiation, division, inversion /sup 1)/architecture, etc. efficiently based on the Montgomery multiplication proposed in this paper. Since cellular automata architecture is simple, regular, modular and cascadable, it can be utilized efficiently for the implementation of VLSI.
유한 필드 GF(2
Keywords