A Parallel and Uniform k-Partition Method for Montgomery Multiplication

DOI10.1109/TC.2013.89zbMATH Open1364.65311MaRDI QIDQ5267411FDOQ5267411

Alexandre Ferreira Tenca, Wilson Vicente Ruggiero, João Carlos Néto

Publication date: 20 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited In (3)

• Compact SD: a new encoding algorithm and its application in multiplication
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery

   Recommendations

• A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype 👍 👎
• Title not available (Why is that?) 👍 👎
• Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields 👍 👎
• Title not available (Why is that?) 👍 👎
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation 👍 👎
• Parallel computation of the multi-exponentiation for cryptosystems 👍 👎
• A practical parallel algorithm for computinga b modc * 👍 👎
• Title not available (Why is that?) 👍 👎
• Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m) 👍 👎
• New frameworks for Montgomery’s modular multiplication method 👍 👎

This page was built for publication: A Parallel and Uniform $k$-Partition Method for Montgomery Multiplication

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