Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Securing Elliptic Curve Cryptography with Random Permutation of Secret Key
View through CrossRef
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 2iG as well as the corresponding secret key bits ki. 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.
Title: Securing Elliptic Curve Cryptography with Random Permutation of Secret Key
Description:
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 2iG as well as the corresponding secret key bits ki.
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.
Related Results
Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A.
Comparative book review: Cryptography: An Introduction by V. V. Yaschenko (American Mathematical Society, 2002); Cryptanalysis of Number Theoretic Ciphers by S.S. Wagstaff, Jr. (Chapman & Hall/CRC Press, 2003); RSA and Public-Key Cryptography by R. A.
With the growing interest in cryptography --- from students and
researchers as well as from the general public --- there has been a
corresponding increase in the number of cryptogr...
Enhanced Scalar Multiplication Algorithm over Prime Field Using Elliptic Net
Enhanced Scalar Multiplication Algorithm over Prime Field Using Elliptic Net
Scalar multiplication in elliptic curve cryptography is the most expensive and time-consuming operation. The elliptic curve cryptography attracted interest due to the development o...
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
A Novel Image Encryption Algorithm Based on Double Permutation and Random Diffusion
Abstract
To improve the image transmission security, an image encryption algorithm based on double permutation with random diffusion is proposed in this paper. This algorit...
A Survey about Post Quantum Cryptography Methods
A Survey about Post Quantum Cryptography Methods
Cryptography is an art of hiding the significant data or information with some other codes. It is a practice and study of securing information and communication. Thus, cryptography...
A Comprehensive Review on Cryptography Algorithms: Methods and Comparative Analysis
A Comprehensive Review on Cryptography Algorithms: Methods and Comparative Analysis
The evolution of cryptography has been crucial to preservation subtle information in the digital age. From early cipher algorithms implemented in earliest societies to recent crypt...
Hyper Elliptical Curve Cryptography (Hecc) For Cloud
Hyper Elliptical Curve Cryptography (Hecc) For Cloud
This system provides an insight into developing a distributed system which is secure, robust and user friendly. This thesis suggests a design and implementation of a digital envelo...
Efficient Elliptic Curve Arithmetic for Lightweight Cryptographic Schemes for IoT Applications
Efficient Elliptic Curve Arithmetic for Lightweight Cryptographic Schemes for IoT Applications
The Internet of Things’ (IoT) market is expected to grow exponentially at the global level in the coming years, due to the proliferation of more reliable and faster networks result...
Choosing a Suitable Public Cryptosystem for Internet of Things
Choosing a Suitable Public Cryptosystem for Internet of Things
The Internet of Things (IoT) has ushered in numerous devices in many areas in our life and in industries. It could comprise devices with sensors to gather and broadcast data over t...