scientific article; zbMATH DE number 3961705

MaRDI QIDQ3728972zbMATH OpenFDO

Authors Kenmei Kukihara

Publication date 1985

zbMATH Keywords

algorithmmultiplication modulo an integer

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Theory of computing (68Q99)

Recommendations

• scientific article; zbMATH DE number 62666
• A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
• Modular Multiplication Without Trial Division
• A faster modular multiplication algorithm
• A modular integer GCD algorithm

Cited in

(9)

• Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics
• Efficient algorithms for remainder computation and exponentiation of long numbers
• An iterative modular multiplication algorithm
• Maximum number of steps taken by modular exponentiation and Euclidean algorithm
• Modular Multiplication Without Trial Division
• An Algorithm for Multiplication in Modular Arithmetic
• scientific article; zbMATH DE number 4006333 (Why is no real title available?)
• scientific article; zbMATH DE number 62666 (Why is no real title available?)
• A new modulo computation algorithm

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