Efficient implementation of Montgomery modular multiplier on FPGA
Authors:
- Ahmed A.H. Abd-ElkaderAAAhmed A.H. Abd-Elkader
- Mostafa RashdanMRMostafa Rashdan
- El-Sayed A.M. HasaneenEHEl-Sayed A.M. Hasaneen
- Hesham F.A. HamedHHHesham F.A. Hamed
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 97
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Fast Montgomery modular multiplier for Rivest–Shamir–Adleman cryptosystemIET Information Security, 2019
- Optimized Modular Multiplication for Supersingular Isogeny Diffie-HellmanIEEE Transactions on Computers, 2019
- Compact FPGA hardware architecture for public key encryption in embedded devicesPLOS ONE, 2018
- Internet of things: Vision, applications and research challengesAd Hoc Networks, 2012
- Modular multiplication without trial divisionMathematics of Computation, 1985