Modified Montgomery modular multiplication and RSA exponentiation techniques

@inproceedings{McIvor2004ModifiedMM,
  title={Modified Montgomery modular multiplication and RSA exponentiation techniques},
  author={Ciaran McIvor and M{\'a}ire McLoone and John V. McCanny},
  year={2004}
}
Modified Montgomery multiplication and associated RSA modular exponentiation algorithms and circuit architectures are presented. These modified multipliers use carry save adders (CSAs) to perform large word length additions. These have the attraction that, when repeatedly used to perform RSA modular exponentiation, the (carry save) format of the output words is compatible with that required by the multiplier inputs. This avoids the repeated interim output/input format conversion, needed when… 
A New Montgomery Modular Multiplication Algorithm and its VLSI Design for RSA Cryptosystem
TLDR
A unified Montgomery modular multiplication algorithm that can be applied to fulfil either the conventional modular multiplication or squaring operation in carry-save form so as to achieve area-efficient design of modular exponentiation is proposed.
An Optimized Montgomery Modular Multiplication Algorithm for Cryptography
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystems. The previous Montgomery multipliers perform a
Modular Multiplication and Exponentiation Architectures for Fast RSA Cryptosystem Based on Digit Serial Computation
TLDR
Experimental results show that the proposed modular exponentiation and modular-multiplication design obtain the best delay performance compared with the published works and outperform them in terms of area-time complexity as well.
New and Improved Architectures for Montgomery Modular Multiplication
TLDR
An improved Montgomery multiplier, based on modified four-to-two carry-save adders (CSAs) to reduce critical path delay, is presented and a new bit-sliced, unified and scalable Montgomery multiplier architecture, applicable for both RSA and ECC, is proposed.
A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem
TLDR
This paper presents a new modular exponentiation architecture with a unified modular multiplication/square module and shows how to reduce the number of input operands for the CSA tree by mathematical manipulation and shows that the developed architecture obtains the least hardware complexity compared with the existing work.
RSA Cryptosystem with Modified Montgomery Modular Multiplier
TLDR
The proposed Montgomery modular multiplier has the capability to provide 26% average reduction in power when compared with previous designs and has been proposed to reduce the power consumption of CCSA.
Pipelined VLSI Architecture for RSA Based on Montgomery Modular Multiplication
  • 2016
Modular multiplication forms a key operation in many public key cryptosystems. Montgomery Multiplication is one of the wellknown algorithms to carry out the modular multiplication more quickly. Carry
An RNS Based Montgomery Modular Multiplication Algorithm For Cryptography
Montgomery modular multiplication is one of the fundamental operations used in cryptographic algorithms, such as RSA and Elliptic Curve Cryptosystem. The previous Montgomery multipliers perform a
High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift Technique
  • A. Rezai, P. Keshavarzi
  • Computer Science
    IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2015
TLDR
A new and efficient Montgomery modular multiplication architecture based on a new digit serial computation that relaxes the high-radix partial multiplication to a binary multiplication and performs several multiplications of consecutive zero bits in one clock cycle instead of several clock cycles is presented.
Efficient FPGA Modular Multiplication and Exponentiation Architectures Using Digit Serial Computation
TLDR
Experimental results show that the proposed modular exponentiation and modular multiplication design obtains the best delay performance compared with previous published works and outperforms them in terms of area-time complexity.
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
Montgomery modular exponentiation on reconfigurable hardware
  • Thomas Blum
  • Computer Science
    Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336)
  • 1999
TLDR
This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs) and shows that it is possible to implement modular exponentiation at secure bit lengths on a single commercially available FPGA.
Asynchronous implementation of 1024-bit modular processor for RSA cryptosystem
  • Y. Kim, Wooseok Kang, J. Choi
  • Computer Science
    Proceedings of Second IEEE Asia Pacific Conference on ASICs. AP-ASIC 2000 (Cat. No.00EX434)
  • 2000
TLDR
An implementation method to optimize a single-chip 1024-bit RSA processor based on the modified algorithm and architecture with 0.65-/spl mu/m SOG technology using Verilog HDL is presented.
Modular multiplication without trial division
Let N > 1. We present a method for multiplying two integers (called N-residues) modulo N while avoiding division by N. N-residues are represented in a nonstandard way, so this method is useful only
Montgomery exponentiation needs no final subtractions
Montgomery's modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed that there is no need for extra cleaning up at the end of an
Hardware Implementation of Montgomery's Modular Multiplication Algorithm
TLDR
Hardware is described for implementing the fast modular multiplication algorithm developed by P.L. Montgomery (1985), showing that this algorithm is up to twice as fast as the best currently available and is more suitable for alternative architectures.
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important
Fast decipherment algorithm for RSA public-key cryptosystem
A fast algorithm is presented for deciphering cryptograms involved in the public-key cryptosystem proposed by Rivest, Shamir and Adleman. The deciphering method is based on the Chinese remainder
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of
Network and Internetwork Security: Principles and Practice
TLDR
Each basic building block of network security is covered, including conventional and public-key cryptography, authentication, and digital signatures, as are methods for countering hackers and other intruders and viruses.