New frameworks for Montgomery’s modular multiplication method

DOI10.1090/S0025-5718-03-01543-6zbMATH Open1045.11089MaRDI QIDQ4452169FDOQ4452169

Authors Philip B. Jun. McLaughlin

Publication date 12 February 2004

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

zbMATH Keywords

convolutionmodular multiplicationdiscrete Fourier transformsKaratsuba 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)

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

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

Cited in

(13)

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

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)