Analysis and improvement of modular inverse algorithm

MaRDI QIDQ3372641zbMATH OpenFDO

Authors Lijuan Tan, Yun Chen

Publication date 9 March 2006

zbMATH Keywords

public key cryptosystemEuclideanmodular inverseextended Euclidean

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A fast modular multiplication algorithm
• scientific article; zbMATH DE number 1979275
• The Montgomery inverse and its applications
• Improving modular inversion in RNS using the plus-minus method
• New modular multiplication algorithms for fast modular exponentiation

Cited in

(6)

• scientific article; zbMATH DE number 1979275 (Why is no real title available?)
• Improving modular inversion in RNS using the plus-minus method
• A binary algorithm with low divergence for modular inversion on SIMD architectures
• Subtraction-free almost Montgomery inverse algorithm
• Improving the Accuracy of Inverse Iteration
• A general method to decompose modular multiplicative inverse operators over group of units

This page was built for publication: Analysis and improvement of modular inverse algorithm

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