KJCKorea
Journal Central

@article{ART002934371},
author={Keewon Kim},
title={Efficient Semi-systolic Montgomery multiplier over GF(2^m)},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2023},
volume={28},
number={2},
pages={69-75},
doi={10.9708/jksci.2023.28.02.069}

TY - JOUR
AU - Keewon Kim
TI - Efficient Semi-systolic Montgomery multiplier over GF(2^m)
JO - Journal of The Korea Society of Computer and Information
PY - 2023
VL - 28
IS - 2
PB - The Korean Society Of Computer And Information
SP - 69
EP - 75
SN - 1598-849X
AB - Finite field arithmetic operations play an important role in a variety of applications, including modern cryptography and error correction codes. In this paper, we propose an efficient multiplication algorithm over finite fields using the Montgomery multiplication algorithm. Existing multipliers can be implemented using AND and XOR gates, but in order to reduce time and space complexity, we propose an algorithm using NAND and NOR gates. Also, based on the proposed algorithm, an efficient semi-systolic finite field multiplier with low space and low latency is proposed. The proposed multiplier has a lower area-time complexity than the existing multipliers. Compared to existing structures, the proposed multiplier over finite fields reduces space-time complexity by about 71%, 66%, and 33% compared to the multipliers of Chiou et al., Huang et al., and Kim-Jeon. As a result, our multiplier is proper for VLSI and can be successfully implemented as an essential module for various applications.
KW - Finite fields;Montgomery multiplication;Semi-systolic array;Cryptography
DO - 10.9708/jksci.2023.28.02.069
ER -

Keewon Kim. (2023). Efficient Semi-systolic Montgomery multiplier over GF(2^m). Journal of The Korea Society of Computer and Information, 28(2), 69-75.

Keewon Kim. 2023, "Efficient Semi-systolic Montgomery multiplier over GF(2^m)", Journal of The Korea Society of Computer and Information, vol.28, no.2 pp.69-75. Available from: doi:10.9708/jksci.2023.28.02.069

Keewon Kim "Efficient Semi-systolic Montgomery multiplier over GF(2^m)" Journal of The Korea Society of Computer and Information 28.2 pp.69-75 (2023) : 69.

Keewon Kim. Efficient Semi-systolic Montgomery multiplier over GF(2^m). 2023; 28(2), 69-75. Available from: doi:10.9708/jksci.2023.28.02.069

Keewon Kim. "Efficient Semi-systolic Montgomery multiplier over GF(2^m)" Journal of The Korea Society of Computer and Information 28, no.2 (2023) : 69-75.doi: 10.9708/jksci.2023.28.02.069

Keewon Kim. Efficient Semi-systolic Montgomery multiplier over GF(2^m). Journal of The Korea Society of Computer and Information, 28(2), 69-75. doi: 10.9708/jksci.2023.28.02.069

Keewon Kim. Efficient Semi-systolic Montgomery multiplier over GF(2^m). Journal of The Korea Society of Computer and Information. 2023; 28(2) 69-75. doi: 10.9708/jksci.2023.28.02.069

Keewon Kim. Efficient Semi-systolic Montgomery multiplier over GF(2^m). 2023; 28(2), 69-75. Available from: doi:10.9708/jksci.2023.28.02.069

Keewon Kim. "Efficient Semi-systolic Montgomery multiplier over GF(2^m)" Journal of The Korea Society of Computer and Information 28, no.2 (2023) : 69-75.doi: 10.9708/jksci.2023.28.02.069