New frameworks for Montgomery's modular multiplication method

@article{McLaughlin2004NewFF,
  title={New frameworks for Montgomery's modular multiplication method},
  author={Philip B. McLaughlin},
  journal={Math. Comput.},
  year={2004},
  volume={73},
  pages={899-906}
}
We present frameworks for fast modular multiplication based on a modification of Montgomery's original method. For (fixed) large integers, our algorithms may be significantly faster than conventional methods. Our techniques may also be extended to modular polynomial arithmetic. 

Tables from this paper

Spectral arithmetic in Montgomery modular multiplication
TLDR
This survey paper introduces the development of spectral-based MMM, as well as its two important properties: high parallelism and low complexity, and compares these algorithms in terms of digit-level complexity.
A Generalized RNS Mclaughlin Modular Multiplication with Non-Coprime Moduli Sets
  • Zhen Gu, Shuguo Li
  • Mathematics, Computer Science
    IEEE Transactions on Computers
  • 2019
TLDR
A set of moduli that are non-coprime for RNS in the algorithm to take both the advantage of the fewer multiplications required for a modular multiplication in McLaughlin modular multiplication and theadvantage of the moduli sets of similar sizes in classic Montgomery modularmultiplication in RNS.
Trinomial bases and Chinese remaindering for modular polynomial multiplication
TLDR
This paper shows how to keep the same residue basis for modular polynomial multiplication, inspired by l’Hospital rule, and obtains improved estimates on the number of additions for some useful degree ranges.
FFT-Based McLaughlin's Montgomery Exponentiation without Conditional Selections
TLDR
This work restricts the parameters of MLM by a set of new bounds and presents a modified MLM algorithm involving no conditional selection, which improves both area-time efficiency and security against timing attacks.
Subquadratic Polynomial Multiplication over GF(2m) Using Trinomial Bases and Chinese Remaindering
TLDR
This paper shows how to keep the same residue basis for modular polynomial multiplication, inspired by l'Hospital rule, and obtains improved estimates on the number of additions for some useful degree ranges.
Fast convolutions meet Montgomery
TLDR
This paper gives a method for understanding and bypassing the short multiplication problem, thus reducing the costs of ring arithmetic to roughly 2M(R) when also using fast convolutions.
Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
TLDR
This paper integrates the fast Fourier transform (FFT) method into the McLaughlin’s framework, and presents an improved FFT-based Montgomery modular multiplication (MMM) algorithm achieving high area-time efficiency.
Modern Computer Arithmetic
Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics
Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
TLDR
Improvements to FFT-based Montgomery Modular Multiplication (FFTM3) using carry-save arithmetic and pre-computation techniques are presented and pseudo-Fermat number transform is used to enrich the supported operand sizes for the FFTM3.
An efficient FPGA-based accelerator design for convolution
TLDR
A new efficient architecture of the transform have been proposed which support a various operand size and a variant constant geometry architecture is used which the forward and backward sub-stage used the same computation pattern.
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
Discrete weighted transforms and large-integer arithmetic
TLDR
The concept of Discrete Weighted Transforms (DWTs) are introduced which substantially improve the speed of multiplication by obviating costly zero-padding of digits.
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.
Speeding the Pollard and elliptic curve methods of factorization
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations module N and occasionally taking GCDs with N. These began with Pollard's p 1
The art of computer programming. Vol.2: Seminumerical algorithms
TLDR
This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read.
Fast Fourier transform and convolution algorithms
TLDR
This book explains the development of the Fast Fourier Transform Algorithm and its applications in Number Theory and Polynomial Algebra, as well as some examples of its application in Quantization Effects.
The Art in Computer Programming
TLDR
Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
The Art of Computer Programming
TLDR
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Knuth , The Art of Computer Programming , Volume 2 : Seminumerical Algorithms ( 3 rd ed . ) , Addison - Wesley , Boston , MA ,
  • 1998
The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd ed.), Addison-Wesley
  • 1998
Modular multiplication without trial
  • division, Math. Comp
  • 1985
...
1
2
...