Fast modular multiplication using 2-power radix

DOI10.1080/00207169108803976zbMath0742.68019OpenAlexW1982006319MaRDI QIDQ3989850

Colin D. Walter

Publication date: 28 June 1992

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

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

zbMATH Keywords

public key cryptographyinteger divisionmodular multiplicationdigital arithmeticRSA algorithmfast computer arithmeticparallel bit operations

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

A faster modular multiplication algorithm

Cites Work

• A verification of brickell's fast modular multiplication algorithm
• A method for obtaining digital signatures and public-key cryptosystems
• Higher-Radix Division Using Estimates of the Divisor and Partial Remainders

This page was built for publication: Fast modular multiplication using 2-power radix