A faster modular multiplication algorithm

DOI10.1080/00207169108804001zbMath0744.11003OpenAlexW2007954959MaRDI QIDQ3979695

Stephen E. Eldridge

Publication date: 26 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108804001

zbMATH Keywords

public key cryptographyinteger divisionmodular multiplicationdigital arithmeticRSA algorithmredundant number systemsfast computer arithmeticparallel bit operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Software, source code, etc. for problems pertaining to number theory (11-04)

Cites Work

• Fast modular multiplication using 2-power radix
• A verification of brickell's fast modular multiplication algorithm
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A faster modular multiplication algorithm