The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Propomos um novo método que pode acelerar a multiplicação modular particionando fisicamente o tamanho da chave em duas fatias. Ao usar a abordagem LSB-first e MSB-first em dois respectivos módulos de hardware particionados em paralelo, reduzimos o número de iterações na multiplicação modular de k para k/2+1 para koperandos de -bit, e o desempenho resultante é duplicado quando comparado com uma implementação puramente pela abordagem LSB-first ou MSB-first.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Seok-Yong LEE, Yong-Jin JEONG, Oh-Jun KWON, "A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 4, pp. 789-791, April 2002, doi: .
Abstract: We propose a new method that can speed up the modular multiplication by physically partitioning the key size into two slices. By using LSB-first and MSB-first approach on two respective partitioned hardware module in parallel, we reduce the number of iterations in modular multiplication from k to k/2+1 for k-bit operands, and the resulting performance is doubled when contrasted with an implementation purely by LSB-first or MSB-first approach.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_4_789/_p
Copiar
@ARTICLE{e85-d_4_789,
author={Seok-Yong LEE, Yong-Jin JEONG, Oh-Jun KWON, },
journal={IEICE TRANSACTIONS on Information},
title={A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem},
year={2002},
volume={E85-D},
number={4},
pages={789-791},
abstract={We propose a new method that can speed up the modular multiplication by physically partitioning the key size into two slices. By using LSB-first and MSB-first approach on two respective partitioned hardware module in parallel, we reduce the number of iterations in modular multiplication from k to k/2+1 for k-bit operands, and the resulting performance is doubled when contrasted with an implementation purely by LSB-first or MSB-first approach.},
keywords={},
doi={},
ISSN={},
month={April},}
Copiar
TY - JOUR
TI - A Faster Modular Multiplication Based on Key Size Partitioning for RSA Public-Key Cryptosystem
T2 - IEICE TRANSACTIONS on Information
SP - 789
EP - 791
AU - Seok-Yong LEE
AU - Yong-Jin JEONG
AU - Oh-Jun KWON
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2002
AB - We propose a new method that can speed up the modular multiplication by physically partitioning the key size into two slices. By using LSB-first and MSB-first approach on two respective partitioned hardware module in parallel, we reduce the number of iterations in modular multiplication from k to k/2+1 for k-bit operands, and the resulting performance is doubled when contrasted with an implementation purely by LSB-first or MSB-first approach.
ER -