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
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
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)
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
Performance-Scalable Array Architectures for Modular Multiplication
Journal of VLSI Signal Processing Systems
Montgomery in Practice: How to Do It More Efficiently in Hardware
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Another Way of Doing RSA Cryptography in Hardware
Proceedings of the 8th IMA International Conference on Cryptography and Coding
A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
High-Radix Design of a Scalable Modular Multiplier
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Hardware architectures for public key cryptography
Integration, the VLSI Journal
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm
IEEE Transactions on Computers
Efficient scalable VLSI architecture for Montgomery inversion in GF(p)
Integration, the VLSI Journal
Design of a scalable RSA and ECC crypto-processor
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Scalable hardware implementing high-radix Montgomery multiplication algorithm
Journal of Systems Architecture: the EUROMICRO Journal
Efficient pipelining for modular multiplication architectures in prime fields
Proceedings of the 17th ACM Great Lakes symposium on VLSI
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
FPGA based communication security for wireless sensor networks
ESPOCO'05 Proceedings of the 4th WSEAS International Conference on Electronic, Signal Processing and Control
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
A versatile Montgomery multiplier architecture with characteristic three support
Computers and Electrical Engineering
Improved throughput bit-serial multiplier for GF(2m) fields
Integration, the VLSI Journal
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
Finite field arithmetic for cryptography
IEEE Circuits and Systems Magazine
Design and implementation of real time secured RS232 link for multiple FPGA communication
Proceedings of the 2011 International Conference on Communication, Computing & Security
A fast RSA implementation on itanium 2 processor
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
A vector approach to cryptography implementation
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation
Journal of Signal Processing Systems
Attacking RSA---CRT signatures with faults on montgomery multiplication
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
An efficient RSA implementation without precomputation
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the multiplier, and the selection of the word-size is made according to the available area and/or desired performance. We describe the general view of the new architecture, analyze hardware organization for its parallel computation, and discuss design tradeoffs which are useful to identify the best hardware configuration.