Improving the computational efficiency of modular operations for embedded systems
- 1 May 2014
- journal article
- Published by Elsevier BV in Journal of Systems Architecture
- Vol. 60 (5), 440-451
- https://doi.org/10.1016/j.sysarc.2013.10.013
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On Increasing the Computational Efficiency of Long Integer Multiplication on FPGAPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Utilizing hard cores of modern FPGA devices for high-performance cryptographyJournal of Cryptographic Engineering, 2011
- An RSA Encryption Hardware Algorithm using a Single DSP Block and a Single Block RAM on the FPGAInternational Journal of Networking and Computing, 2011
- Large multipliers with fewer DSP blocksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$Lecture Notes in Computer Science, 2006
- High-Radix Design of a Scalable Modular MultiplierLecture Notes in Computer Science, 2001
- High-radix Montgomery modular exponentiation on reconfigurable hardwareIEEE Transactions on Computers, 2001
- A Scalable Architecture for Montgomery NultiplicationLecture Notes in Computer Science, 1999
- Space/time trade-offs for higher radix modular multiplication using repeated additionIEEE Transactions on Computers, 1997
- Modular multiplication without trial divisionMathematics of Computation, 1985