RSD-based high-performance radix-4 Montgomery Modular Multiplication for Elliptic Curve Cryptography
Authors:
- Shilei ZhaoSZShilei Zhao
- Jiwen ZhengJZJiwen Zheng
- Yutong ShaoYSYutong Shao
- Hai HuangHHHai Huang
- Zhiwei LiuZLZhiwei Liu
- Bin YuBYBin Yu
- Ziyue ZhangZZZiyue Zhang
- 10 October 2024
- journal article
- research article
- Published by Elsevier in Microelectronics Journal
- Vol. 153
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A high speed processor for elliptic curve cryptography over NIST prime fieldIET Circuits, Devices & Systems, 2022
- Advanced implementation of Montgomery Modular MultiplierMicroelectronics Journal, 2020
- A high‐speed RSD‐based flexible ECC processor for arbitrary curves over general prime fieldInternational Journal of Circuit Theory and Applications, 2018
- Efficient digit‐serial modular multiplication algorithm on FPGAIET Circuits, Devices & Systems, 2018
- High performance hardware support for elliptic curve cryptography over general prime fieldMicroprocessors and Microsystems, 2017
- Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)International Journal of Circuit Theory and Applications, 2016
- High‐performance elliptic curve cryptography processor over NIST prime fieldsIET Computers & Digital Techniques, 2016
- An efficient signed digit montgomery multiplication for RSAJournal of Systems Architecture, 2009
- An efficient CSA architecture for montgomery modular multiplicationMicroprocessors and Microsystems, 2007
- Exponentiation using canonical recodingTheoretical Computer Science, 1994