A secure algorithm for inversion modulo 2^k

Sadiel de la Fe Siverio, Carles Ferrer Ramis

Producció científica: Contribució a una revistaArticleRecercaAvaluat per experts

1 Citació (Scopus)

Resum

Modular inversions are widely employed in public key crypto-systems, and it is known that they imply a bottleneck due to the expensive computation. Recently, a new algorithm for inversions modulo pk was proposed, which may speed up the calculation of a modulus dependent quantity used in the Montgomery multiplication. The original algorithm lacks security countermeasures; thus, a straightforward implementation may expose the input. This is an issue if that input is a secret. In the RSA-CRT signature using Montgomery multiplication, the moduli are secrets (primes p and q). Therefore, the moduli dependent quantities related to p and q must be securely computed. This paper presents a security analysis of the novel method considering that it might be used to compute secrets. We demonstrate that a Side Channel Analysis leads to disclose the data being manipulated. In consequence, a secure variant for inversions modulo 2k is proposed, through the application of two known countermeasures. In terms of performance, the secure variant is still comparable with the original one.
Idioma originalEnglish
Pàgines (de-a)1
Nombre de pàgines8
RevistaCryptography
Volum2
Número3
DOIs
Estat de la publicacióPublicada - de set. 2018

Fingerprint

Navegar pels temes de recerca de 'A secure algorithm for inversion modulo 2^k'. Junts formen un fingerprint únic.

Com citar-ho