A Parallel and Uniform $k$-Partition Method for Montgomery Multiplication

DOI10.1109/TC.2013.89zbMath1364.65311MaRDI QIDQ5267411

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)

Related Items (2)

Highly parallel modular multiplier for elliptic curve cryptography in residue number system ⋮ 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