Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
IEEE Transactions on Computers
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
IEEE Transactions on Computers
Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition
IEEE Transactions on Computers
Montgomery Multiplication in GF(2^k
Designs, Codes and Cryptography
An improved Montgomery's algorithm for high-speed RSA public-key cryptosystem
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Systolic Modular Multiplication
IEEE Transactions on Computers
A Scalable Architecture for Montgomery Multiplication
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
O(n)-depth circuit algorithm for modular exponentiation
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Simplifying Quotient Determination in High-Radix Modular Multiplication
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Fast Software Exponentiation in GF(2^k)
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
Montgomery Modular Exponentiation on Reconfigurable Hardware
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Design and Implementation of a Coprocessor for Cryptography Applications
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Variable long-precision arithmetic (vlpa) for reconfigurable coprocessor architectures
Variable long-precision arithmetic (vlpa) for reconfigurable coprocessor architectures
Design and Implementation of a Secret Key Steganographic Micro-Architecture Employing FPGA
Proceedings of the conference on Design, automation and test in Europe - Volume 3
Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms
IEEE Transactions on Computers
Scalable hardware implementing high-radix Montgomery multiplication algorithm
Journal of Systems Architecture: the EUROMICRO Journal
A unified and reconfigurable Montgomery Multiplier architecture without four-to-two CSA
Proceedings of the 20th annual conference on Integrated circuits and systems design
Parallelized radix-4 scalable montgomery multipliers
Proceedings of the 20th annual conference on Integrated circuits and systems design
Hardware Complexity of Modular Multiplication and Exponentiation
IEEE Transactions on Computers
High-performance public-key cryptoprocessor for wireless mobile applications
Mobile Networks and Applications
New and improved architectures for Montgomery modular multiplication
Mobile Networks and Applications
Scalable unified dual-radix architecture for montgomery multiplication in GF(P) and GF(2n)
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Enhanced montgomery multiplication on DSP architectures for embedded public-key cryptosystems
EURASIP Journal on Embedded Systems - Embedded System Design in Intelligent Industrial Automation
A unified architecture for a public key cryptographic coprocessor
Journal of Systems Architecture: the EUROMICRO Journal
Computers and Electrical Engineering
WSEAS Transactions on Circuits and Systems
A High-Speed Design of Montgomery Multiplier
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Scalable and Systolic Montgomery Multipliers over GF(2m)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A new algorithm for high-speed modular multiplication design
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Flexible hardware processor for elliptic curve cryptography over NIST prime fields
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Dual-residue montgomery multiplication
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
An optimized hardware architecture for the montgomery multiplication algorithm
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A high-performance unified-field reconfigurable cryptographic processor
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
International Journal of Reconfigurable Computing - Special issue on selected papers from the southern programmable logic conference (SPL2010)
A high performance ROM-based structure for modular exponentiation
Computers and Electrical Engineering
Design of a new kind of encryption kernel based on RSA algorithm
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
A simpler sieving device: combining ECM and TWIRL
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Modular arithmetic and fast algorithm designed for modern computer security applications
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
A compact FPGA-based montgomery multiplier over prime fields
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI
| Hi-index | 14.99 |
This paper presents a scalable architecture for the computation of modular multiplication, based on the Montgomery multiplication (MM) algorithm. A word-based version of MM is presented and used to explain the main concepts in the hardware design. The proposed multiplier is able to work with any precision of the input operands, limited only by memory or control constraints. Its architecture gives enough freedom to select the word size and the degree of parallelism to be used, according to the available area and/or desired performance. Design trade offs are analyzed in order to identify adequate hardware configurations for a given area or bandwidth requirement.