Fast algorithms for implemention of Montgomery's modular multiplication technique

DOI10.1007/S00034-004-0820-XzbMath1062.68015OpenAlexW2169807069MaRDI QIDQ1770035

P. V. Ananda Mohan

Publication date: 5 April 2005

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-004-0820-x

zbMATH Keywords

high-radix implementationsmultibit recoding

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Related Items (1)

Efficient algorithms for remainder computation and exponentiation of long numbers

This page was built for publication: Fast algorithms for implemention of Montgomery's modular multiplication technique