New frameworks for Montgomery’s modular multiplication method

DOI10.1090/S0025-5718-03-01543-6MaRDI QIDQ4452169zbMATH OpenFDO

Authors Philip B. Jun. McLaughlin

Publication date 12 February 2004

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

Full work available at URL https://doi.org/10.1090/S0025-5718-03-01543-6

zbMATH Keywords

convolutiondiscrete Fourier transformsKaratsuba multiplicationmodular multiplication

Mathematics Subject Classification ID

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

Recommendations

• New Hardware Architectures for Montgomery Modular Multiplication Algorithm
• New iterative algorithms for modular multiplication
• New modular multiplication algorithms for fast modular exponentiation
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• The Iterative Structure Analysis of Montgomery Modular Multiplication
• A new fast modular arithmetic method in public key cryptography
• scientific article; zbMATH DE number 2079918
• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields
• scientific article; zbMATH DE number 1979274

Cites work

• Discrete Weighted Transforms and Large-Integer Arithmetic
• Fast Fourier transform and convolution algorithms
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• Modular Multiplication Without Trial Division
• Speeding the Pollard and Elliptic Curve Methods of Factorization

Cited in

(15)

• Efficient algorithms for remainder computation and exponentiation of long numbers
• Fast direct computation of modular reduction
• Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
• A faster modular multiplication algorithm
• scientific article; zbMATH DE number 62666 (Why is no real title available?)
• Montgomery reduction with even modulus
• scientific article; zbMATH DE number 1979274 (Why is no real title available?)
• Montgomery multiplication over rings
• scientific article; zbMATH DE number 1456815 (Why is no real title available?)
• A Parallel and Uniform k-Partition Method for Montgomery Multiplication
• The Montgomery model revisited
• Fast convolutions meet Montgomery
• Progress in Cryptology - INDOCRYPT 2004
• Introduction
• Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452169)