GMC-crypto: Low latency implementation of ECC point multiplication for generic Montgomery curves over GF(p)
Authors:
- Khalid JaveedKJKhalid Javeed
- Yasir Ali ShahYSYasir Ali Shah
- David GreggDGDavid Gregg
- 3 July 2024
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 193
Abstract
No abstract availableKeywords
Funding Information
- H2020 Marie Skłodowska-Curie Actions (754489)
- Horizon 2020
- Science Foundation Ireland (13/RC/2094-P2)
This publication has 37 references indexed in Scilit:
- Area‐time efficient point multiplication architecture on twisted Edwards curve over general prime field GF(p)International Journal of Circuit Theory and Applications, 2023
- High‐speed parallel reconfigurable Fp multipliers for elliptic curve cryptography applicationsInternational Journal of Circuit Theory and Applications, 2022
- Efficient implementation of Montgomery modular multiplier on FPGAComputers and Electrical Engineering, 2022
- Lightweight elliptic curve cryptography accelerator for internet of things applicationsAd Hoc Networks, 2020
- An efficient hardware implementation of the elliptic curve cryptographic processor over prime field,International Journal of Circuit Theory and Applications, 2020
- Fast unified elliptic curve point multiplication for NIST prime curves on FPGAsJournal of Cryptographic Engineering, 2019
- High-performance ECC processor architecture design for IoT security applicationsThe Journal of Supercomputing, 2019
- A high‐speed RSD‐based flexible ECC processor for arbitrary curves over general prime fieldInternational Journal of Circuit Theory and Applications, 2018
- Montgomery curves and their arithmeticJournal of Cryptographic Engineering, 2017
- Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)International Journal of Circuit Theory and Applications, 2016