Hardware Implementation of Area-Time Efficient Modular Multiplication over NIST Prime Fields

This research presents an efficient modular multipli-cation for elliptic curve cryptography (ECC) over NIST prime fields. The development of ECC processors that can perform modular multiplication while minimizing hardware utilization is a crucial need in cryptography and cybersecurity. The efficiency of modular multiplication is a key factor that directly impacts the overall performance of ECC processors. Achieving fast modular multiplication with low hardware usage involves optimizing the design of ECPs to balance computational speed, resource utilization, and resistance to side-channel attacks. Our proposed design aims to achieve higher performance with reduced power consumption. For performance evaluation, we synthesized our design on various FPGA platforms, including Virtex-7 and Virtex-6, using different NIST primes. The mostly used 256-bit modular multiplication device utilization is reduced greatly here, and we extend this work to higher bits, i.e., 384-bit and 521-bit NIST primes.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/spicscon64195.2024.10940486
Citations
1
Primary Topic
Cryptography and Residue Arithmetic
Type
article
Field-Weighted Citation Impact
0.78
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hardware Implementation of Area-Time Efficient Modular Multiplication over NIST Prime Fields

Kalyan Kumar Halder, Md. Sazedur Rahman, Ibnul Zarrah
1 citations
Cryptography and Residue Arithmetic
0.78
article

Hardware Implementation of Area-Time Efficient Modular Multiplication over NIST Prime Fields

Kalyan Kumar Halder, Md. Sazedur Rahman, Ibnul Zarrah
article en
1 citations

Abstract

This research presents an efficient modular multipli-cation for elliptic curve cryptography (ECC) over NIST prime fields. The development of ECC processors that can perform modular multiplication while minimizing hardware utilization is a crucial need in cryptography and cybersecurity. The efficiency of modular multiplication is a key factor that directly impacts the overall performance of ECC processors. Achieving fast modular multiplication with low hardware usage involves optimizing the design of ECPs to balance computational speed, resource utilization, and resistance to side-channel attacks. Our proposed design aims to achieve higher performance with reduced power consumption. For performance evaluation, we synthesized our design on various FPGA platforms, including Virtex-7 and Virtex-6, using different NIST primes. The mostly used 256-bit modular multiplication device utilization is reduced greatly here, and we extend this work to higher bits, i.e., 384-bit and 521-bit NIST primes.

Khulna University of Engineering and Technology (BD), Hajee Mohammad Danesh Science and Technology University (BD)
Openalex Percentile: Top 17%
Cryptography and Residue Arithmetic
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Hardware Implementation of Area-Time Efficient Modular Multiplication over NIST Prime Fields — Kalyan Kumar Halder, Md. Sazedur Rahman, et al. · (2024) | TGRS Research Map | TGRS