New algorithm for classical modular inverse

DOI10.1007/3-540-36400-5_6MaRDI QIDQ4425687zbMATH OpenFDO

Authors Róbert Lórencz

Publication date 11 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2523/25230057.htm

zbMATH Keywords

cryptographyhardware implementationleft-shift binary algorithmmodular inverseMontgomery inverse

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• The Montgomery inverse and its applications
• Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics
• GCD-free algorithms for computing modular inverses.
• Analysis and improvement of modular inverse algorithm
• Subtraction-free almost Montgomery inverse algorithm

Cited in

(9)

• Subtraction-free almost Montgomery inverse algorithm
• Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics
• An algorithm for numerically inverting the modular \(j\)-function
• Computing the modular inverses is as simple as computing the GCDs
• A general method to decompose modular multiplicative inverse operators over group of units
• Analysis and improvement of modular inverse algorithm
• The Montgomery inverse and its applications
• GCD-free algorithms for computing modular inverses.
• New algorithms for modular inversion and representation by the form \(x^2+ 3xy + y^2\)

This page was built for publication: New algorithm for classical modular inverse

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