A cryptographic library for the Motorola DSP56000
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Designs, Codes and Cryptography
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Systolic Modular Multiplication
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
The design space layer: supporting early design space exploration for core-based designs
DATE '99 Proceedings of the conference on Design, automation and test in Europe
High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
IEEE Transactions on Computers
Systolic multiplier for Montgomery's algorithm
Integration, the VLSI Journal
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Montgomery's Multiplication Technique: How to Make It Smaller and Faster
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A Scalable Architecture for Montgomery Multiplication
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
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
The Hessian Form of an Elliptic Curve
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Achieving NTRU with Montgomery Multiplication
IEEE Transactions on Computers
A Scalable Dual-Field Elliptic Curve Cryptographic Processor
IEEE Transactions on Computers
On Multiple Precision Based Montgomery Multiplication without Precomputation of N0' = -N0-1 mod W
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Fast authenticated key establishment protocols for self-organizing sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm
IEEE Transactions on Computers
Accelerating the secure remote password protocol using reconfigurable hardware
Proceedings of the 1st conference on Computing frontiers
A Full RNS Implementation of RSA
IEEE Transactions on Computers
Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation
IEEE Transactions on Computers
A Hardware Algorithm for Modular Multiplication/Division
IEEE Transactions on Computers
On-demand design service innovations
IBM Journal of Research and Development
Low-Weight Polynomial Form Integers for Efficient Modular Multiplication
IEEE Transactions on Computers
Efficient pipelining for modular multiplication architectures in prime fields
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Compact modular exponentiation accelerator for modern FPGA devices
Computers and Electrical Engineering
Comparison of innovative signature algorithms for WSNs
WiSec '08 Proceedings of the first ACM conference on Wireless network security
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
FPGA design for algebraic tori-based public-key cryptography
Proceedings of the conference on Design, automation and test in Europe
Exploiting the Power of GPUs for Asymmetric Cryptography
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
Coupon Recalculation for the GPS Authentication Scheme
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Montgomery exponent architecture based on programmable cellular automata
Mathematics and Computers in Simulation
WSEAS Transactions on Circuits and Systems
A High-Speed Design of Montgomery Multiplier
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Crypto Engineering: Some History and Some Case Studies
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
An efficient signed digit montgomery multiplication for RSA
Journal of Systems Architecture: the EUROMICRO Journal
On the implementation of the discrete Fourier transform in the encrypted domain
IEEE Transactions on Information Forensics and Security
A highly efficient cipher processor for dual-field elliptic curve cryptography
IEEE Transactions on Circuits and Systems II: Express Briefs
An RNS implementation of an Fpelliptic curve point multiplier
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Cryptographic side-channels from low-power cache memory
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
An approach to formal verification of arithmetic functions in assembly
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Power analysis for secret recovering and reverse engineering of public key algorithms
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Dual-residue montgomery multiplication
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
On the BRIP algorithms security for RSA
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
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
Proceedings of the ACM SIGCOMM 2010 conference
Design and implementation of robust embedded processor for cryptographic applications
Proceedings of the 3rd international conference on Security of information and networks
VoteBox nano: a smaller, stronger FPGA-based voting machine
EVT/WOTE'09 Proceedings of the 2009 conference on Electronic voting technology/workshop on trustworthy elections
pSHS: a scalable parallel software implementation of Montgomery multiplication for multicore systems
Proceedings of the Conference on Design, Automation and Test in Europe
Low-resource hardware design of an elliptic curve processor for contactless devices
WISA'10 Proceedings of the 11th international conference on Information security applications
High speed systolic Montgomery modular multipliers for RSA cryptosystems
IMCAS'06 Proceedings of the 5th WSEAS international conference on Instrumentation, measurement, circuits and systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate representation
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
An exploration of mechanisms for dynamic cryptographic instruction set extension
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Design and evaluation of parallel, scalable, curve based processor over binary field
WSEAS Transactions on Computers
Modular number systems: beyond the mersenne family
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A fast RSA implementation on itanium 2 processor
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Non-linear residue codes for robust public-key arithmetic
FDTC'06 Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
An optimised architecture for radix-2 Montgomery modular multiplication on FPGA
International Journal of High Performance Systems Architecture
Energy-efficient software implementation of long integer modular arithmetic
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
High-Speed RSA crypto-processor with radix-4 modular multiplication and chinese remainder theorem
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Simple power analysis on exponentiation revisited
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Anonymous credentials for java enabled platforms: a performance evaluation
INTRUST'09 Proceedings of the First international conference on Trusted Systems
Evaluating 16-bit processors for elliptic curve cryptography
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
A hardware processor supporting elliptic curve cryptography for less than 9 kGEs
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Software implementation of modular exponentiation, using advanced vector instructions architectures
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Tsunami: massively parallel homomorphic hashing on many-core GPUs
Concurrency and Computation: Practice & Experience
Attacking RSA---CRT signatures with faults on montgomery multiplication
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
An 8-bit AVR-Based Elliptic Curve Cryptographic RISC Processor for the Internet of Things
MICROW '12 Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture Workshops
A compact FPGA-based montgomery multiplier over prime fields
Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI
Twisted edwards-form elliptic curve cryptography for 8-bit AVR-based sensor nodes
Proceedings of the first ACM workshop on Asia public-key cryptography
Attacks on implementations of cryptographic algorithms: side-channel and fault attacks
Proceedings of the 6th International Conference on Security of Information and Networks
PRIME: private RSA infrastructure for memory-less encryption
Proceedings of the 29th Annual Computer Security Applications Conference
NEON implementation of an attribute-based encryption scheme
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.02 |
This article discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe three additional algorithms, and analyze in detail the space and time requirements of all five methods. These algorithms have been implemented in C and in assembler. The analyses and actual performance results indicate that the Coarsely Integrated Operand Scanning (CIOS) method, detailed in this article, is the most efficient of all five algorithms, at least for the general class of processor we considered. The Montgomery multiplication methods constitute the core of the modular exponentiation operation which is the most popular method used in public-key cryptography for encrypting and signing digital data.