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
Este trabalho apresenta um novo algoritmo de Montgomery escalável e sistólico em GF(2m). O algoritmo proposto é baseado na representação matricial-vetorial de Toeplitz, que obtém o multiplicador de Montgomery escalável e sistólico de forma flexível, podendo se adaptar à precisão necessária. Os resultados analíticos indicam que o multiplicador proposto sobre o campo genérico de GF(2m) tem uma latência de d+n(2n+1), onde n =
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
Chin-Chin CHEN, Chiou-Yng LEE, Erl-Huei LU, "Scalable and Systolic Montgomery Multipliers over GF(2m)" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 7, pp. 1763-1771, July 2008, doi: 10.1093/ietfec/e91-a.7.1763.
Abstract: This work presents a novel scalable and systolic Montgomery's algorithm in GF(2m). The proposed algorithm is based on the Toeplitz matrix-vector representation, which obtains the scalable and systolic Montgomery multiplier in a flexible manner, and can adapt to the required precision. Analytical results indicate that the proposed multiplier over the generic field of GF(2m) has a latency of d+n(2n+1), where n =
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.7.1763/_p
Copiar
@ARTICLE{e91-a_7_1763,
author={Chin-Chin CHEN, Chiou-Yng LEE, Erl-Huei LU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Scalable and Systolic Montgomery Multipliers over GF(2m)},
year={2008},
volume={E91-A},
number={7},
pages={1763-1771},
abstract={This work presents a novel scalable and systolic Montgomery's algorithm in GF(2m). The proposed algorithm is based on the Toeplitz matrix-vector representation, which obtains the scalable and systolic Montgomery multiplier in a flexible manner, and can adapt to the required precision. Analytical results indicate that the proposed multiplier over the generic field of GF(2m) has a latency of d+n(2n+1), where n =
keywords={},
doi={10.1093/ietfec/e91-a.7.1763},
ISSN={1745-1337},
month={July},}
Copiar
TY - JOUR
TI - Scalable and Systolic Montgomery Multipliers over GF(2m)
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1763
EP - 1771
AU - Chin-Chin CHEN
AU - Chiou-Yng LEE
AU - Erl-Huei LU
PY - 2008
DO - 10.1093/ietfec/e91-a.7.1763
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2008
AB - This work presents a novel scalable and systolic Montgomery's algorithm in GF(2m). The proposed algorithm is based on the Toeplitz matrix-vector representation, which obtains the scalable and systolic Montgomery multiplier in a flexible manner, and can adapt to the required precision. Analytical results indicate that the proposed multiplier over the generic field of GF(2m) has a latency of d+n(2n+1), where n =
ER -