New frameworks for Montgomery’s modular multiplication method

DOI10.1090/S0025-5718-03-01543-6zbMath1045.11089MaRDI QIDQ4452169

Philip B. Jun. McLaughlin

Publication date: 12 February 2004

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

convolutiondiscrete Fourier transformsmodular multiplicationKaratsuba multiplication

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (2)

Fast convolutions meet Montgomery ⋮ Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering

Cites Work

• Unnamed Item
• Fast Fourier transform and convolution algorithms
• Modular Multiplication Without Trial Division
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Discrete Weighted Transforms and Large-Integer Arithmetic

This page was built for publication: New frameworks for Montgomery’s modular multiplication method