A Parallel and Uniform k-Partition Method for Montgomery Multiplication

DOI10.1109/TC.2013.89MaRDI QIDQ5267411zbMATHFDO

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

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)

Recommendations

• A Parallel Implementation of Montgomery Multiplication on Multicore Systems: Algorithm, Analysis, and Prototype
• scientific article; zbMATH DE number 2118995
• Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields
• Publication:4502772
• 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 *
• scientific article; zbMATH DE number 1617930
• Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
• New frameworks for Montgomery’s modular multiplication method

Cited in

(3)

• 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
• Compact SD: a new encoding algorithm and its application in multiplication

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)