Securing Elliptic Curve Cryptography with Random Permutation of Secret Key.
Saved in:
| Title: | Securing Elliptic Curve Cryptography with Random Permutation of Secret Key. |
|---|---|
| Authors: | Gebali, Fayez, Magdy, Alshimaa |
| Source: | Telecom; Dec2025, Vol. 6 Issue 4, p75, 24p |
| Subject Terms: | ELLIPTIC curve cryptography, CRYPTOGRAPHY, NUMERICAL analysis, PUBLIC key cryptography, ALGORITHMS |
| Abstract: | Scalar multiplication is the basis of the widespread elliptic curve public key cryptography. Standard scalar multiplication is vulnerable to side-channel attacks that are able to infer the secret bit values by observing the power or delay traces. This work utilizes the arithmetic properties of scalar multiplication to propose two scalar multiplication algorithms to insulate ECC implementations from side-channel attacks. The two proposed designs rely on randomly permuting the ordering and storage locations of the different scalar multiplication values 2 i G as well as the corresponding secret key bits k i . Statistical analysis and Python 3.9.13implementations confirm the validity of the two algorithms. Numerical results confirm that both designs produce the same results as the standard right-to-left scalar multiplication algorithm. Welch's t-test as well as numerical simulations confirm the immunity of our proposed protocols to side-channel attacks. [ABSTRACT FROM AUTHOR] |
| Copyright of Telecom is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!