Comparative Analysis of Elliptic Curve and Lattice Based Cryptography

Author(s):  
Amanda Davenport ◽  
Sachin Shetty
Author(s):  
Chandrakala B M ◽  
S C Lingareddy

<p>In recent days, data sharing has provided the flexibility to share the data, store the data, and perform operation on data virtually as well as cost effectively. Data sharing in cloud is one of the feature, which is being popular and widely accepted. However, the concern here is to ensure the data security and this has led the researcher to research in this area. To provide the security several Proxy re-encryption scheme has been introduced, however all these method lacks of efficiency. Hence In this paper, we propose a scheme known as ALBC (Adaptive Lattice Based Cryptography), this scheme follows the two phase i.e. encryption and Re-encryption. Encryption phase has few algorithms such as Key_Gen, Enc, Dec. Similarly ALBC Re-Enc has five algorithm i.e. Key_Gen, Key_ReGen,  Enc, Re-Enc, Dec. our algorithm not only provides the security but also solves the problem of RL(Ring-learning) with errors problems. In order to evaluate, our algorithm is compared with the existing model in terms of encryption time, decryption time, re-encryption time, key generation  and key regeneration by varying the various key size. When we observe the comparative analysis, it is observed that our algorithm outperforms the existing algorithm.</p>


2021 ◽  
Author(s):  
M. Babenko ◽  
A. Tchernykh ◽  
A. Redvanov ◽  
A. Djurabaev

In today's world, the problem of information security is becoming critical. One of the most common cryptographic approaches is the elliptic curve cryptosystem. However, in elliptic curve arithmetic, the scalar point multiplication is the most expensive compared to the others. In this paper, we analyze the efficiency of the scalar multiplication on elliptic curves comparing Affine, Projective, Jacobian, Jacobi-Chudnovsky, and Modified Jacobian representations of an elliptic curve. For each coordinate system, we compare Fast exponentiation, Nonadjacent form (NAF), and Window methods. We show that the Window method is the best providing lower execution time on considered coordinate systems.


2007 ◽  
Vol 177 (4S) ◽  
pp. 398-398
Author(s):  
Luis H. Braga ◽  
Joao L. Pippi Salle ◽  
Sumit Dave ◽  
Sean Skeldon ◽  
Armando J. Lorenzo ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document