Optimized implementation of RSA cryptosystem
Computers and Security
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
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
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
The Montgomery Modular Inverse-Revisited
IEEE Transactions on Computers - Special issue on computer arithmetic
Montgomery Multiplier and Squarer for a Class of Finite Fields
IEEE Transactions on Computers
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
New Algorithm for Classical Modular Inverse
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2)
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Hardware architectures for public key cryptography
Integration, the VLSI Journal
Efficient scalable VLSI architecture for Montgomery inversion in GF(p)
Integration, the VLSI Journal
Subtraction-free almost montgomery inverse algorithm
Information Processing Letters
A Carry-Free Architecture for Montgomery Inversion
IEEE Transactions on Computers
A-Codes from Rational Functions over Galois Rings
Designs, Codes and Cryptography
Improvement to Montgomery Modular Inverse Algorithm
IEEE Transactions on Computers
Modular inverse algorithms without multiplications for cryptographic applications
EURASIP Journal on Embedded Systems
Collision Search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Elliptic Curve Cryptography on FPGA for Low-Power Applications
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Generalized Scalar Multiplication Secure against SPA, DPA, and RPA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the implementation of the discrete Fourier transform in the encrypted domain
IEEE Transactions on Information Forensics and Security
An RNS implementation of an Fpelliptic curve point multiplier
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Subtraction-free Almost Montgomery Inverse algorithm
Information Processing Letters
Finite field arithmetic for cryptography
IEEE Circuits and Systems Magazine
An ECDSA pocessor for RFID athentication
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Low-resource hardware design of an elliptic curve processor for contactless devices
WISA'10 Proceedings of the 11th international conference on Information security applications
A cryptographic processor for low-resource devices: canning ECDSA and AES like sardines
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
Optimal use of montgomery multiplication on smart cards
CARDIS'06 Proceedings of the 7th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Efficient multi-bit shifting algorithm in multiplicative inversion problems
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
International Journal of Applied Cryptography
Accelerating inverse of GF(2n) with precomputation
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
International Journal of Applied Cryptography
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
Generalized high speed Itoh-Tsujii multiplicative inversion architecture for FPGAs
Integration, the VLSI Journal
Exploring the design space of prime field vs. binary field ECC-Hardware implementations
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Arithmetic unit for computations in GF(p) with the left-shifting multiplicative inverse algorithm
ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
| Hi-index | 14.99 |
The Montgomery inverse of b modulo a is b驴12n mod a, where n is the number of bits in a. The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse. The new inverse facilitates recent work by Koç on modular exponentiation and has other applications in cryptography.