Next Article in Journal
A New Visual Multi-Secrets Sharing Scheme by Random Grids
Next Article in Special Issue
A New Technique in Rank Metric Code-Based Encryption
Previous Article in Journal
Correlation-Based Robust Authentication (Cobra) Using Helper Data Only
Previous Article in Special Issue
Cryptanalysis of a Proposal Based on the Discrete Logarithm Problem Inside Sn
Article Menu

Export Article

Open AccessArticle
Cryptography 2018, 2(3), 23; https://doi.org/10.3390/cryptography2030023

A Secure Algorithm for Inversion Modulo 2k

1,2,†,* and 1
1
Department of Microelectronics and Electronic Systems, Universitat Autònoma de Barcelona, 08193 Barcelona, Spain
2
Applus Laboratories, Bellaterra, 08193 Barcelona, Spain
Current address: Applus Laboratories, Carrer de la Font del Carme, Bellaterra, 08193 Barcelona, Spain.
*
Author to whom correspondence should be addressed.
Received: 21 August 2018 / Revised: 10 September 2018 / Accepted: 12 September 2018 / Published: 13 September 2018
(This article belongs to the Special Issue Public Key Cryptography)
Full-Text   |   PDF [223 KB, uploaded 13 September 2018]

Abstract

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 p k 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 2 k is proposed, through the application of two known countermeasures. In terms of performance, the secure variant is still comparable with the original one. View Full-Text
Keywords: modular inversion; montgomery multiplication; RSA; side channel attack modular inversion; montgomery multiplication; RSA; side channel attack
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

De la Fe, S.; Ferrer, C. A Secure Algorithm for Inversion Modulo 2k. Cryptography 2018, 2, 23.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top