GCD-Free Algorithms for Computing Modular Inverses

DOI10.1007/978-3-540-45238-6_20zbMath1274.11176OpenAlexW1572990863MaRDI QIDQ5187959

Pascal Paillier, Marc Joye

Publication date: 9 March 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-540-45238-6_20

zbMATH Keywords

prime numbersembedded softwaremodular inversesefficient implementationsRSA key generationGCD algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

Improvements to RSA key generation and CRT on embedded devices ⋮ A general method for to decompose modular multiplicative inverse operators over Group of units

This page was built for publication: GCD-Free Algorithms for Computing Modular Inverses