A fast modular multiplication algorithm

DOI10.1080/00207169308804210MaRDI QIDQ4291041zbMATH OpenOpenAlexFDO

Authors Che Wun Chiou

Publication date 5 May 1994

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

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

zbMATH Keywords

cryptographymodular exponentiationmodular multiplicationsparallel processingpublic-key cryptosystems

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• New modular multiplication algorithms for fast modular exponentiation
• scientific article; zbMATH DE number 2118995
• scientific article; zbMATH DE number 1294069
• scientific article; zbMATH DE number 4191561

Cites work

• A method for obtaining digital signatures and public-key cryptosystems

Cited in

(29)

• A generalisation of Brickell's algorithm for fast modular multiplication
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• Efficient big integer multiplication and squaring algorithms for cryptographic applications
• An efficient modulo p multiplication algorithm with moderate factors of p+1 and p-1
• Fast integer multiplication using modular arithmetic
• New modular multiplication algorithms for fast modular exponentiation
• Another look at some fast modular arithmetic methods
• scientific article; zbMATH DE number 4191561 (Why is no real title available?)
• Analysis and improvement of modular inverse algorithm
• scientific article; zbMATH DE number 5708383 (Why is no real title available?)
• Speeding up bipartite modular multiplication
• scientific article; zbMATH DE number 24466 (Why is no real title available?)
• Fast modular multiplication using 2-power radix
• scientific article; zbMATH DE number 54561 (Why is no real title available?)
• scientific article; zbMATH DE number 1294069 (Why is no real title available?)
• scientific article; zbMATH DE number 1024055 (Why is no real title available?)
• scientific article; zbMATH DE number 1024495 (Why is no real title available?)
• scientific article; zbMATH DE number 2085209 (Why is no real title available?)
• scientific article; zbMATH DE number 2118995 (Why is no real title available?)
• An efficient RSA implementation without precomputation
• Exploiting Linearity of Modular Multiplication
• Efficient Modular Arithmetic
• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• Algorithms and Computation
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Topics in Cryptology – CT-RSA 2004
• An iterative modular multiplication algorithm in RNS
• New iterative algorithms for modular multiplication

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

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