Fast modular multiplication using 2-power radix

DOI10.1080/00207169108803976MaRDI QIDQ3989850zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 4191561
• A faster modular multiplication algorithm
• scientific article; zbMATH DE number 1294069
• A design of fast pipelined modular multiplier based on a diminished-radix algorithm
• A fast modular multiplication algorithm

Cites work

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

Cited in

(9)

• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• Algorithms and Computation
• scientific article; zbMATH DE number 2127886 (Why is no real title available?)
• A design of fast pipelined modular multiplier based on a diminished-radix algorithm
• Topics in Cryptology – CT-RSA 2004
• scientific article; zbMATH DE number 2219412 (Why is no real title available?)
• A faster modular multiplication algorithm
• scientific article; zbMATH DE number 4191561 (Why is no real title available?)
• Fast integer multiplication using modular arithmetic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989850)