arrow
返回

EC-Crypto: Highly Efficient Area-Delay Optimized Elliptic Curve Cryptography Processor

delete2023-01-01
delete19
delete
OA
AI
K
Khalid Javeed *
A
Ali A. El‐Moursy
D
David Gregg
DOI:10.1109/ACCESS.2023.3282781delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Elliptic Curve Cryptography (ECC) based security protocols require much shorter key space which makes ECC the most suitable option for resource-limited devices as compared to the other public key cryptography (PKC) schemes. This paper presents a highly efficient area-delay optimized ECC crypto processor over the general prime field ( F-p). It is structured on a new novel finite field multiplier (FFM) where several optimization techniques have been incorporated to shorten the latency and hardware resource consumption. The proposed FFM architecture is embedded with a finite field adder/subtractor (FFAS) unit which is utilized to perform FFAS operations instead of deploying a dedicated unit. The Common Z (Co-Z) coordinates with the Montgomery ladder method are used to compute point multiplication, a core operation in all ECC-based crypto protocols. The work also proposes an efficient scheduling strategy to execute low-level finite field arithmetic primitives with minimum latency on the employed finite field arithmetic units. Due to these techniques, the proposed ECC processor is optimized for hardware resources, latency, and throughput. It is captured in Verilog-HDL, synthesized, and implemented on Virtex-7, Kintex-7, and Virtex-6 FPGA platforms using Xilinx Vivado and ISE Design Suite tools. On the Virtex-7 FPGA platform, it computes a single 256-bit scalar multiplication primitive in 0.7ms, consumes just 6.2K slices, and delivers a throughput of 1428 operations per second. The implementation results show that it is a highly efficient design outperforming the state-of-the-art by providing a better area-delay product and higher efficiency. Therefore, it has the potential to be deployed in many applications where both latency and resource requirements are critical.
Keyword:
Galois fields
Elliptic curve cryptography
Field programmable gate arrays
Computer architecture
Arithmetic
Hardware acceleration
Throughput
Elliptic curve cryptography (ECC)
finite field multiplication
field programmable gate array (FPGA)
hardware acceleration
finite field arithmetic

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

T
Trinity College Dublin
学者数:
2.4W
论文数: 1.9W
被引数: 2.7W
U
University of Sharjah
学者数:
5.9K
论文数: 5.5K
被引数: 8.8K
引用论文

引用论文

Concussion and the Young Athlete
err2013-01-26
err0
PREAI
errCaroline Faure; Cynthia A. Lee Pemberton
err分享
err收藏
err分享
err收藏
Disorganization of the splenic microanatomy in ageing mice
err2016-03-17
err0
errOAAI
errDanielle Aw; Lucy Hilliard; Yoshio Nishikawa; Emma T. Cadman; Rachel A. Lawrence; Donald B. Palmer
err分享
err收藏
Advanced Automated Model for Robust Bone Marrow Segmentation in Whole-body MRI高级自动化模型用于全身MRI的鲁棒骨髓分割
err2025-01-01
err1
errOAAI
errBauer, F; Kaechele, J; Bernhard, J; Hajiyianni, M; Weinhold, N; Sauer, S; Groezinger, M; Raab, MS; Mai, EK; Weber, TF; Goldschmidt, H; Schlemmer, HP; Maier-Hein, K; Delorme, S; Neher, P; Wennmann, M
err分享
err收藏
学者 查看更多内容