An FPGA implementation of systolic array for Montgomery multiplication
Public-key cryptographic algorithms such as RSA algorithm require modular multiplications of very large operands. In RSA, the higher security the larger operand size which may reduce the clock rate and result to lower throughput This paper presents a fully systolic linear-array for the computation o...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Published: |
Animo Repository
2005
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/8207 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
id |
oai:animorepository.dlsu.edu.ph:faculty_research-8946 |
---|---|
record_format |
eprints |
spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-89462023-01-31T05:29:50Z An FPGA implementation of systolic array for Montgomery multiplication Nazar, Medi A. Kittitornkun, Surin Bunyatnoparat, Pratheep Public-key cryptographic algorithms such as RSA algorithm require modular multiplications of very large operands. In RSA, the higher security the larger operand size which may reduce the clock rate and result to lower throughput This paper presents a fully systolic linear-array for the computation of Montgomery modular multiplication that is implemented using FPGA. Our fully systolic design shows that a high and nearly constant clock rate is achievable regardless of the size of the operand. As co1npared with the non-fully systolic architecture, our design offers higher frequency that yields a higher throughput rate and a lower area-time product. The total execution time for an 11- bit modular multiplication is 3n+1 cycles, latency of 2n+1, where n is the length of the modulus and a throughput of 1 bit per clock cycle. 2005-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/8207 Faculty Research Work Animo Repository Public key cryptography Field programmable gate arrays Systolic array circuits Electrical and Computer Engineering |
institution |
De La Salle University |
building |
De La Salle University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
De La Salle University Library |
collection |
DLSU Institutional Repository |
topic |
Public key cryptography Field programmable gate arrays Systolic array circuits Electrical and Computer Engineering |
spellingShingle |
Public key cryptography Field programmable gate arrays Systolic array circuits Electrical and Computer Engineering Nazar, Medi A. Kittitornkun, Surin Bunyatnoparat, Pratheep An FPGA implementation of systolic array for Montgomery multiplication |
description |
Public-key cryptographic algorithms such as RSA algorithm require modular multiplications of very large operands. In RSA, the higher security the larger operand size which may reduce the clock rate and result to lower throughput This paper presents a fully systolic linear-array for the computation of Montgomery modular multiplication that is implemented using FPGA. Our fully systolic design shows that a high and nearly constant clock rate is achievable regardless of the size of the operand. As co1npared with the non-fully systolic architecture, our design offers higher frequency that yields a higher throughput rate and a lower area-time product. The total execution time for an 11- bit modular multiplication is 3n+1 cycles, latency of 2n+1, where n is the length of the modulus and a throughput of 1 bit per clock cycle. |
format |
text |
author |
Nazar, Medi A. Kittitornkun, Surin Bunyatnoparat, Pratheep |
author_facet |
Nazar, Medi A. Kittitornkun, Surin Bunyatnoparat, Pratheep |
author_sort |
Nazar, Medi A. |
title |
An FPGA implementation of systolic array for Montgomery multiplication |
title_short |
An FPGA implementation of systolic array for Montgomery multiplication |
title_full |
An FPGA implementation of systolic array for Montgomery multiplication |
title_fullStr |
An FPGA implementation of systolic array for Montgomery multiplication |
title_full_unstemmed |
An FPGA implementation of systolic array for Montgomery multiplication |
title_sort |
fpga implementation of systolic array for montgomery multiplication |
publisher |
Animo Repository |
publishDate |
2005 |
url |
https://animorepository.dlsu.edu.ph/faculty_research/8207 |
_version_ |
1767196856513724416 |