TITLE

A SECURE DIFFIE-HELLMAN SCHEMES OVER ELLIPTIC CURVES

AUTHOR(S)
Kakish, Malek Jakob
PUB. DATE
January 2012
SOURCE
International Journal of Research & Reviews in Applied Sciences;2012, Vol. 10 Issue 1, p98
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The protection of information technologies is very essential because information technologies play a major role in our information society, such protection includes data and system protection against many kinds of threats or attacks which may lead to lose of money, or lose of reputation and thus destroy businesses. The Diffie-Hellman public key cryptosystem over elliptic curves is often used in modern communications and system technologies; it is one of the firstly defined public key cryptosystem that enable secure communicating over public unsecure communication channels. This paper introduce a security Diffie-Hellman cryptosystem based on elliptic curves, it suggests the use of randomization in the encryption process to become immune against many attacks described in literature, this proposed security enhancement describe both the diffie-Hellman key exchange process and the Diffie-Hellman cryptosystem, this enhancement makes the Diffie-Hellman semantically secure, because an attacker will not be able to distinguish between two encryptions even if the attacker knows the corresponding plaintexts. Other important benefit is that the Diffie-Hellamn cryptosystem described here can easily be implemented and is very suitable on small and limited devices (e.g. smart cards) due the use of elliptic curves. This paper also briefly investigate some attacks on the Diffie-Hellman scheme and the suitable choice of Diffie-Hellman parameter to avoid such attacks.
ACCESSION #
78072954

 

Related Articles

  • Cryptanalysis of KMOV cryptosystem with short secret exponent. Ibrahimpašić, Bernadin // Central European Conference on Information & Intelligent Systems;2008, p35 

    In this paper we analyze the KMOV public key cryptosystem, which is an elliptic curve based analogue to RSA. We extend the Dujella variant of well-known Wiener attack on KMOV cryptosystem.

  • Cyclic groups of Elliptic curves-An Implementation to Cryptography. Sekhar, A. Chandra; Lakshmi, G. Naga; Rao, G. Sivanagamalleswar; Kumar, B. Ravi // International Journal of Advanced Research in Computer Science;Sep/Oct2011, Vol. 2 Issue 5, p544 

    Cryptography is the process of sending the messages in unknown form so that the receiving party can remove the unknown part of the message and can read the original message. The study of cryptography extended to new concepts and techniques basically from the applications of Number...

  • NOVEL ELLIPTIC CURVE SCALAR MULTIPLICATION ALGORITHMS FOR FASTER AND SAFER PUBLIC-KEY CRYPTOSYSTEMS. Iyengar, Vinay S. // International Journal on Cryptography & Information Security;Sep2012, Vol. 2 Issue 3, p57 

    Efficient and secure public-key cryptosystems are essential in today's age of rapidly growing Internet communications. Elliptic curve scalar multiplication in particular, which refers to the operation of multiplying a large integer by a point on an elliptic curve, is crucial for both data...

  • Elliptic Curves with Low Embedding Degree. Luca, Florian; Shparlinski, Igor E. // Journal of Cryptology;Autumn2006, Vol. 19 Issue 4, p553 

    Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic curves with low embedding degree, which are also of importance for pairing-based cryptography. We give some heuristic arguments which suggest that there are only about z1/2+ o(1) of MNT curves...

  • Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves,. Smith, Benjamin // Journal of Cryptology;Autumn2009, Vol. 22 Issue 4, p505 

    We describe the use of explicit isogenies to translate instances of the Discrete Logarithm Problem (DLP) from Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, where they are vulnerable to faster index calculus attacks. We provide explicit formulae for...

  • Efficient generation of secure elliptic curves. Konstantinou, Elisavet; Stamatiou, Yannis; Zaroliagis, Christos // International Journal of Information Security;Jan2007, Vol. 6 Issue 1, p47 

    In many cryptographic applications it is necessary to generate elliptic curves (ECs) whose order possesses certain properties. The method that is usually employed for the generation of such ECs is the so-called Complex Multiplication method. This method requires the use of the roots of certain...

  • Isomorphic transformations of an elliptic curve over a finite field. Chevardin, V. // Cybernetics & Systems Analysis;May2013, Vol. 49 Issue 3, p472 

    Transformations of points of a nonsupersingular elliptic curve are selected as a promising method for the further development of cryptographic systems. Statements are proved on estimates of the number of isomorphic transformations of a nonsupersingular elliptic curve over an extension of a...

  • Two-Factor Remote Authentication Protocol with User Anonymity Based on Elliptic Curve Cryptography. Zhang, Liping; Tang, Shanyu; Chen, Jing; Zhu, Shaohui // Wireless Personal Communications;Mar2015, Vol. 81 Issue 1, p53 

    In order to provide secure remote access control, a robust and efficient authentication protocol should realize mutual authentication and session key agreement between clients and the remote server over public channels. Recently, Chun-Ta Li proposed a password authentication and user anonymity...

  • Design of digital signature scheme based on elliptic curve cryptosystem. ShiGuo Jin; GuangJiang Wang // Applied Mechanics & Materials;2014, Issue 682-686, Special section p579 

    Digital signature is electronically password technique for electronic document signature. Elliptic curve cryptography is a method of public key cryptography based on elliptic curve mathematical. Digital signature scheme consists of three processes: initialization process, the signature...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics