scientific article; zbMATH DE number 4191561

zbMATH Open0722.94017MaRDI QIDQ3211250FDOQ3211250

Authors: Hikaru Morita 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

fast compact modular-multiplication algorithmhigher radix

Mathematics Subject Classification ID

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

Cited In (19)

• Title not available (Why is that?)
• Efficient Modular Arithmetic
• A generalisation of Brickell's algorithm for fast modular multiplication
• Title not available (Why is that?)
• Fast direct computation of modular reduction
• An efficient modulo \(p\) multiplication algorithm with moderate factors of \(p+1\) and \(p-1\)
• Algorithms and Computation
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• A design of fast pipelined modular multiplier based on a diminished-radix algorithm
• Topics in Cryptology – CT-RSA 2004
• Title not available (Why is that?)
• A Low-Complexity High-Radix RNS Multiplier
• 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
• Fast integer multiplication using modular arithmetic
• An iterative modular multiplication algorithm in RNS
• 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)