scientific article; zbMATH DE number 4191561

MaRDI QIDQ3211250zbMATH OpenFDO

Authors Hikaru Morita

Publication date 1990

zbMATH Keywords

fast compact modular-multiplication algorithmhigher radix

Mathematics Subject Classification ID

Cryptography (94A60) Computer aspects of numerical algorithms (65Y99)

Recommendations

• Fast modular multiplication using 2-power radix
• Fast direct computation of modular reduction
• A fast modular multiplication algorithm
• A faster modular multiplication algorithm
• Topics in Cryptology – CT-RSA 2004

Cited in

(20)

• scientific article; zbMATH DE number 54561 (Why is no real title available?)
• Efficient Modular Arithmetic
• A generalisation of Brickell's algorithm for fast modular multiplication
• Fast direct computation of modular reduction
• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\)
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• Algorithms and Computation
• 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 Low-Complexity High-Radix RNS Multiplier
• Compact SD: a new encoding algorithm and its application in multiplication
• Another look at some fast modular arithmetic methods
• Analysis of the variable length nonzero window method for exponentiation
• Fast modular multiplication using 2-power radix
• An iterative modular multiplication algorithm in RNS
• Fast integer multiplication using modular arithmetic
• New iterative algorithms for modular multiplication

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 Q3211250)