scholarly journals Implementation Methodology of ECC to Overcome Side Channel Attacks

2018 ◽  
Vol 7 (3.27) ◽  
pp. 421
Author(s):  
M Maheswari ◽  
R A. Karthika ◽  
Anuska Chatterjee
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Public Key Cryptography ◽  
Public Key ◽  
Side Channel ◽  
Side Channel Attacks ◽  
Private Key ◽  
Wide Range ◽  
Cryptographic Algorithms ◽  
Implementation Methodology

Elliptic Curve Cryptography (ECC) is a form of public-key cryptography. This implies that there is the involvement of a private key and a public key for the purpose of cryptography. ECC can be used for a wide range of applications. The keys used are much smaller than the non-ECC cryptographic algorithms. 256 bit and 384 bit ECC are used by NSA for storage of classified intel as ECC is considered to be a part of suit B cryptography by the NSA. When it comes to normal usage, other versions of ECC are used. So, many of the applications protected by ECC are vulnerable to side channel attacks. So, the objective is to modify the existing method of implementation of ECC is some regular domains like media, smart grid, etc., such that the side-channel attacks [7], [3] vulnerabilities are fixed.  

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

Blockchain and PUF-Based Secure Transaction Procedure for Bitcoin

2021 ◽  
pp. 172-188
Author(s):  
Sivasankari Narasimhan
Keyword(s):  
Hash Functions ◽  
Public Key Cryptography ◽  
Public Key ◽  
Random Numbers ◽  
Physical Unclonable Function ◽  
Private Key ◽  
Wide Range ◽  
Private And Public

In the blockchain, the transaction hashes are implemented through public-key cryptography and hash functions. Hence, there is a possibility for the two users to choose the same private key knowingly or unknowingly. Even the intruders can follow the particular user's bitcoin transaction, and they can masquerade as that user by generating the private and public key pairs of him. If it happens, the user may lose his transaction. Generally, bitcoin technology uses random numbers from 1 to 2256. It is a wide range, but for a greater number of users, there should be one another solution. There is a possibility of digital prototyping which leads to the loss of more accounts. This chapter provides the device-specific fingerprint technology known as physical unclonable function (PUF) to be employed for authentication in a blockchain-based bitcoin environment. The random unique response from PUF ensures correct transaction. In this chapter, a new tetrahedral oscillator PUF has been introduced intrinsically. All the blockchain operations are carried out and verified with PUF response.

An Improved Montgomery Window Algorithm on Modular Exponentiation Secure against Side Channel Attacks

2013 ◽  
Vol 392 ◽  
pp. 862-866
Author(s):  
Mu Han ◽  
Jia Zhao ◽  
Shi Dian Ma
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Side Channel ◽  
Modular Exponentiation ◽  
Side Channel Attacks ◽  
The Core

As one of the core algorithms in most public key cryptography, modular exponentiation has a flaw of its efficiency, which often uses the Montgomerys algorithm to realize the fast operation. But the Montgomerys algorithm has the issue of side channel leakage from the final conditional subtraction. Aiming at this problem, this paper presents an improved fast Montgomery window algorithm. The new algorithm generates the remainder table with odd power to reduce the amount of pre-computation, and combines with the improved Montgomerys algorithm to realize modular exponentiation, which can accelerate the speed and reduce the side channel leakage. The new algorithm cant only thwart side channel attacks, but also improve the efficiency.

Study on the Safety Application of Public Key Cryptography in Electronic Commerce

2014 ◽  
Vol 1079-1080 ◽  
pp. 856-859
Author(s):  
Yu Zhong Zhang
Keyword(s):  
Electronic Commerce ◽  
Elliptic Curve ◽  
Communication Technology ◽  
Elliptic Curve Cryptography ◽  
Public Key Cryptography ◽  
Public Key ◽  
Electronic Transactions ◽  
Safety Application

With the progress of computer and communication technology, electronic commerce flourished. Security is a key problem in the development of electronic commerce. This paper discusses the principle of elliptic curve cryptography and its safety application in electronic transactions.

scholarly journals Scalable Normal Basis Arithmetic Unit for Elliptic Curve Cryptography

10.14311/688 ◽  
2005 ◽  
Vol 45 (2) ◽  
Author(s):  
J. Schmidt ◽  
M. Novotný
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Additional Data ◽  
Public Key Cryptography ◽  
Normal Basis ◽  
Public Key ◽  
Arithmetic Unit ◽  
Inversion Algorithm ◽  
Implementation Data ◽  
And Inversion

The design of a scalable arithmetic unit for operations over elements of GF(2m) represented in normal basis is presented. The unit is applicable in public-key cryptography. It comprises a pipelined Massey-Omura multiplier and a shifter. We equipped the multiplier with additional data paths to enable easy implementation of both multiplication and inversion in a single arithmetic unit. We discuss optimum design of the shifter with respect to the inversion algorithm and multiplier performance. The functionality of the multiplier/inverter has been tested by simulation and implemented in Xilinx Virtex FPGA.We present implementation data for various digit widths which exhibit a time minimum for digit width D = 15.

A synthesis of side-channel attacks on elliptic curve cryptography in smart-cards

2013 ◽  
Vol 3 (4) ◽  
pp. 241-265 ◽  
Author(s):  
Jean-Luc Danger ◽  
Sylvain Guilley ◽  
Philippe Hoogvorst ◽  
Cédric Murdica ◽  
David Naccache
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Smart Cards ◽  
Side Channel ◽  
Side Channel Attacks
Sign in / Sign up

Export Citation Format

Share Document