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)

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

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)

Cites Work

• Title not available (Why is that?)
• Modular Multiplication Without Trial Division
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Discrete Weighted Transforms and Large-Integer Arithmetic
• Fast Fourier transform and convolution algorithms

Cited In (13)

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

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)