An iterative modular multiplication algorithm

DOI10.1016/S0898-1221(02)00138-4MaRDI QIDQ1609170zbMATH OpenFDO

Authors R. Smith

Publication date 15 August 2002

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

iterative modular multiplication algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 922659
• scientific article; zbMATH DE number 3961705
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• scientific article; zbMATH DE number 1953319
• New iterative algorithms for modular multiplication

Cites work

• scientific article; zbMATH DE number 438988 (Why is no real title available?)
• scientific article; zbMATH DE number 194942 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Computer Algorithm for Calculating the Product AB Modulo M
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An axiomatic basis for computer programming
• Modular Multiplication Without Trial Division
• Using encryption for authentication in large networks of computers

Cited in

(5)

• A decimal multiplication algorithm for microcomputers
• Multiple product modulo arbitrary numbers
• Multiple product modulo arbitrary numbers
• scientific article; zbMATH DE number 5708383 (Why is no real title available?)
• An iterative modular multiplication algorithm in RNS

This page was built for publication: An iterative modular multiplication algorithm

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