MATEC Web Conf.
Volume 76, 201620th International Conference on Circuits, Systems, Communications and Computers (CSCC 2016)
|Number of page(s)||7|
|Published online||21 October 2016|
Unifier register to protect an efficient modular exponentiation algorithm
Universidad Nacional Autónoma de México Campus Cuautitlán. Cuautitlán Izcalli, Edo. Mex., México
a Corresponding author: firstname.lastname@example.org
Simple power analysis (SPA) attacks are widely used against several cryptosystems, principally against those based on modular exponentiation. Many types of SPA have been reported in the literature in the recent years. There is a real necessity to eliminate the vulnerabilities of cryptosystems, such as CRT-RSA or the Elliptic Curve Cryptosystem, that make them susceptible to these attacks. There are many modular exponentiation algorithms that try to reinforce the security of these systems, of which one was proposed by Da-Zhi et al.
Da-zhi’s algorithm was presented as a secure and efficient countermeasure against side channel attacks; however, recently it was shown that its security can be defeated. In this paper, a means of protecting the algorithm is presented. The proposed technique can be applied in any algorithm that computes dummy operations through its execution.
Key words: Cryptography / modular exponentiation algorithms / side channel attacks / fault attacks / Jacobi symbol
© The Authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Initial download of the metrics may take a while.