Comparative Analysis of Authenticated Key Agreement Protocols Based on Elliptic Curve Cryptography

Nimbhorkar, S. U.; Malik, Latesh

doi:10.1016/j.procs.2016.02.065

Cited by 5 publications

(5 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we have made use of the encryption algorithms and implemented them both classical and quantum environments. Cryptographic algorithms such as, Blowfish, an algorithm which is a symmetric block cipher that can be used as a drop-in replacement for DES (Data Encryption Standard) or IDEA (International Data Encryption Algorithm) [1], RSA, an asymmetric algorithm that is the encryption and decryption procedure are done with two different keys -public key and private key, and the private key cannot be derived from the public key, that enables the publication of the encryption key without the risk of leaking the secrets [2], and ECC, another asymmetric cryptographic algorithms that is similar to RSA but uses elliptical curves which is built upon algebraic structure of elliptic curve over finite fields [3] are used. Using these two computational methods enables us to derive a broader perspective on cryptography algorithms and how they work on quantum computers.…”

Section: Introductionmentioning

confidence: 99%

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Akshay,

Narayanan,

et al. 2024

Preprint

View full text Add to dashboard Cite

In the overall context of enhanced application of quantum computing into multitude of areas, the paper explores and implements classical encryption algorithms both in traditional and quantum computing environments. Towards this, the classical encryption algorithms such as Blowfish, RSA and ECC are executed in both classical and quantum environments. The result shows that the key generated in the classical hardware is limited to 64-bit as envisaged; the quantum key is generated found to be complex as the instruction set changes from classical instruction set to quantum instruction set. Further, the additional factor of randomness in quantum computing increases the security of the cipher text, which is transmitted over the internet, showing insights for practical applications.

show abstract

Section: Introductionmentioning

confidence: 99%

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Akshay,

Narayanan,

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

“…Laurent et al [4] stated about various digital techniques. Nimbhorkar and Malik [5] discussed only about key agreement protocol using ECC. Leaning [6] elaborated having physical access to an internet enabled system.…”

Section: Maintaining the Integrity Of The Specificationsmentioning

confidence: 99%

“…Kim (1997) given process for Discrete Logarithms [4]. Sun (1999) given method for Discrete Logarithms [5]. Hwang (2003) given procedure for RSA and Lagrange Coefficient [6].…”

Section: History Of Various Proxy Signature Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Cryptanalytic Performance Appraisal of Improved HLL, KUOCHEN, GENGVRF, FENGVRF Secure Signature with TKIP Digital Workspaces: For Financial Cryptography

Kumar

2020

Wireless Pers Commun

View full text Add to dashboard Cite

Financial Cryptography and Security Engineering are the significant areas for research, advanced development, education, exploration and also for commercial purposes. The paper emphasizes both essential and applied real-world deployments on all aspects as far as e-commerce security is concerned. In essence, we recognize several issues of financial cryptography and suitable technique to concentrate on them. Enhanced multi-sign signature scheme may be considered for parameters like Histogram, Diagram, Trigram and n-gram etc. Quantum Computing and TKIP delivers more comprehensive security and effective performance as compared to existing public key methods.

show abstract

“…Then determine the elliptic group element E19 (1,1) which is the settlement of the equation y2=x3+x+1 (mod 19), for x ∈ F19 and y2 ∈ QR19. Here are the steps to find elements of elliptic curve groups or dots on the elliptic curve based of elliptic curve equations that have been formed: [23] a. Set x from 0 to p -1, for this matter means x={0, 1,. .…”

Section: Ecc Procedures Phase 1: Determining the Main Points Of Elliptic Curvementioning

confidence: 99%

Efficiency of 128-bit Encryption and Decryption Process in Elgamal Method Using Elliptic Curve Cryptography (ECC)

Nofriansyah¹,

Syaref²,

Maya³

et al. 2018

TELKOMNIKA

View full text Add to dashboard Cite

Cryptography is a growing science of data security. The integrity of a data is an important thing to keep the secrets contained in the data. In this research will be visualized the efficient quantities that use elliptic curves and do not use them. The Elgamal method is an asymmetric cryptographic algorithm whose complexity of processes. It is especially for digital signatures. This research will discuss about the use of ECC to optimize and streamline the Encryption and Decryption process in particular 128-bit Elgamal method. The hope is that by using elliptic curves the timing of the encryption and decryption process can run faster in the computation of Elgamal Method.

show abstract

Comparative Analysis of Authenticated Key Agreement Protocols Based on Elliptic Curve Cryptography

Cited by 5 publications

References 29 publications

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

WITHDRAWN: Implementation of Encryption Algorithms in Classical and Quantum Computing: A comparative Analysis

Cryptanalytic Performance Appraisal of Improved HLL, KUOCHEN, GENGVRF, FENGVRF Secure Signature with TKIP Digital Workspaces: For Financial Cryptography

Efficiency of 128-bit Encryption and Decryption Process in Elgamal Method Using Elliptic Curve Cryptography (ECC)

Contact Info

Product

Resources

About