scientific article; zbMATH DE number 1294069

MaRDI QIDQ4246338zbMATH OpenFDO

Authors Der-Chyuan Lou, Chin-Chen Chang

Publication date 14 June 2000

zbMATH Keywords

cryptosystemsmodular multiplication

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• A fast modular multiplication algorithm
• New modular multiplication algorithms for fast modular exponentiation
• scientific article; zbMATH DE number 2118995
• scientific article; zbMATH DE number 2104055

Cited in

(20)

• A generalisation of Brickell's algorithm for fast modular multiplication
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• 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
• Fast modular multiplication based on complement representation and canonical recoding
• Another look at some fast modular arithmetic methods
• A new fast modular arithmetic method in public key cryptography
• Speeding up bipartite modular multiplication
• scientific article; zbMATH DE number 24466 (Why is no real title available?)
• Fast modular multiplication using 2-power radix
• A fast modular multiplication algorithm
• scientific article; zbMATH DE number 2104055 (Why is no real title available?)
• Exploiting Linearity of Modular Multiplication
• Efficient Modular Arithmetic
• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• scientific article; zbMATH DE number 3223196 (Why is no real title available?)
• Topics in Cryptology – CT-RSA 2004
• Backtracking-assisted multiplication
• An iterative modular multiplication algorithm in RNS

This page was built for publication:

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