Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract)

@inproceedings{Iwamura1992SystolicArraysFM,
  title={Systolic-Arrays for Modular Exponentiation Using Montgomery Method (Extended Abstract)},
  author={Keiichi Iwamura and Tsutomu Matsumoto and Hideki Imai},
  booktitle={EUROCRYPT},
  year={1992}
}
This paper proposes two ideas for modular exponentiation using Montgomery method. (1) A novel algorithm for modular exponentiation without operation of subtracting N for every Montgomery's modular multiplication (MMM). (2) Two types of systolic-array for MMM which can realize more efficient and flexible chip implementation than the array in [1]. 
Efficient Fixed-Size Systolic Arrays for the Modular Multiplication
TLDR
This paper presents an efficient fixed-size systolic array for Montgomery's modular multiplication designed by the LPGS (Locally Parallel Globally Sequential) partition method and addresses a computation pipelining technique, which improves the throughput and minimizes the buffer size used.
Hardware implementation of a Montgomery modular multiplier in a systolic array
TLDR
A hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of public key cryptography (PKC) and RSA cryptosystems is described, and modular exponentiation based on Montgomery's Multiplication Method (MMM) is presented.
A novel systolic VLSI architecture for fast RSA modular multiplication
TLDR
This paper proposes a modified version of Montgomery's modular multiplication algorithm using a precomputed addition result, and then the proposed algorithm is mapped onto linear systolic arrays of processing elements for modular multiplication.
Montgomery in Practice: How to Do It More Efficiently in Hardware
TLDR
This work presents modular exponentiation based on Montgomery's method without any modular reduction achieving the best possible bound according to C. Walter.
Montgomery Multiplication Using Vector Instructions
TLDR
A parallel approach to compute interleaved Montgomery multiplication which is particularly suitable to be computed on 2-way single instruction, multiple data platforms as can be found on most modern computer architectures in the form of vector instruction set extensions is presented.
A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs
TLDR
An efficient hardware implementation of the Coarsely Integrated Operand Scanning (CIOS) method of Montgomery modular multiplication combined with an effective systolic architecture designed with a two-dimensional array of processing elements is discussed.
Exponentiation, Modular Multiplication and VLSI Implementation of High-Speed RSA Cryptography
TLDR
This Ph.D. thesis treats the calculation of modular exponentials using verylarge operands using very large operands through a top-down approach: modular multiplication, modular addition, addition, modular reduction, and quotient determination.
Systolic array based on fast modular multiplication algorithm for RSA cryptosystem
  • Min-Sup Kang, Dong-Wook Kim
  • Computer Science
    Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030)
  • 1999
A new modular multiplication algorithm is first proposed for increasing the computation speed of addition operations and then a bit-level systolic array architecture is designed for the RSA public
A Scalable and Systolic Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems Based on DSPs
TLDR
An efficient hardware implementation of the Coarsely Integrated Operand Scanning method (CIOS) of Montgomery modular multiplication combined with an effective systolic architecture designed with a Two-dimensional array of Processing Elements is discussed.
A Systolic Hardware Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems
TLDR
An efficient hardware implementation of the Coarsely Integrated Operand Scanning method (CIOS) of Montgomery modular multiplication combined with an effective systolic architecture designed with a Two-dimensional array of Processing Elements is discussed.
...
1
2
3
...

References

SHOWING 1-7 OF 7 REFERENCES
Systolic Modular Multiplication
  • C. D. Walter
  • Computer Science, Mathematics
    IEEE Trans. Computers
  • 1993
TLDR
A systolic array for modular multiplication is presented using the ideally suited algorithm of P.L. Montgomery (1985), where its main use would be where many consecutive multiplications are done, as in RSA cryptosystems.
Systolic Modular Multiplication
A simple systolic array for achieving the effect of modular reduction, in linear time, is described. This circuit, in conjunction with Atrubin’s multiplier, performs modular multiplication in linear
Modular multiplication without trial division
TLDR
A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.
High-Speed Implementation Methods for RSA Scheme
TLDR
This paper proposes two novel implementation methods for the RSA cryptographic scheme and a systolic architecture useful for high-speed and efficient and flexible chip implementation of the RSA scheme.
A Cryptographic Library for the Motorola DSP56000
TLDR
A cryptographic library for the Motorola DSP56000 that provides hardware speed yet software flexibility, and an algorithm for modular multiplication that interleaves multiplication with Montgomery modular reduction to give a very fast implementation of RSA.
Massively Parallel Elliptic Curve Factorin
TLDR
Two massively parallel implementations of the elliptic curve factoring method are described, one of which is based on a new systolic version of Montgomery multiplication.
A cryptographic library for Motorola DSP 56 OOO Systolic modular multiplication
  • Advances i n CryptdogyCRYPTO ‘ QO