Attack on "Strong Diffie-Hellman-DSA KE" and Improvement

Sow, Demba; Camara, Mamadou Ghouraissiou; Sow, Djiby
March 2014
Journal of Mathematics Research;Mar2014, Vol. 6 Issue 1, p70
Academic Journal
In this paper, we do a cryptanalyse of the so called "Strong Diffie-Hellman-DSA Key Exchange (briefly: SDHDSA- KE)" and after we propose "Strong Diffie-Hellman-Exponential-Schnnor Key Exchange (briefly: SDH-XSKE)" which is an improvement for efficiency and security. SDH-XS-KE protocol is secure against Session State Reveal (SSR) attacks, Key independency attacks, Unknown-key share (UKS) attacks and Key-Compromise Impersonation (KCI) attacks. Furthermore, SDH-XS-KE has Perfect Forward Secrecy (PFS) property and a key confirmation step. The new proposition is not vulnerable to Disclosure to ephemeral or long-term Diffie-Hellman exponents. We design our protocol in finite groups therefore this protocol can be implemented in elliptic curves.


Related Articles

  • ECC-Based Password-Authenticated Key Exchange in the Three-Party Setting. Liu, Tingting; Pu, Qiong; Zhao, Yong; Wu, Shuhua // Arabian Journal for Science & Engineering (Springer Science & Bu;Aug2013, Vol. 38 Issue 8, p2069 

    This paper investigates three-party password authenticated key exchange protocols using elliptic curve cryptosystem (ECC). We first show that the direct elliptic curve analog of Chien's protocol proposed most recently is vulnerable to off-line dictionary attack. Thereafter, we present an...

  • A Lightweight RFID Authentication Protocol based on Elliptic Curve Cryptography. Ya-li Liu; Xiao-lin Qin; Chao Wang; Bo-han Li // Journal of Computers;Nov2013, Vol. 8 Issue 11, p2880 

    The security and privacy of the tag carrier has become the bottle neck of Radio Frequency Identification (RFID) system development further. In this paper, we propose a robust authentication protocol based on Elliptic Curve Cryptography (ECC), which meets the requirement of resource-limited RFID...

  • Analyzing the Point Multiplication Operation of Elliptic Curve Cryptosystem over Prime Field for Parallel Processing. Sakthivell, Arumugam; Nedunchezhian, Raju // International Arab Journal of Information Technology (IAJIT);Jul2014, Vol. 11 Issue 4, p322 

    The Elliptic Curve Cryptosystem shortly called as (ECC) is one of the asymmetric key cryptosystems, which provides a high security for wireless applications compared to other asymmetric key cryptosystem. The implementation of this algorithm over prime field Zp has a set of point operations,...

  • MORE FRAÏSSÉ LIMITS OF NILPOTENT GROUPS OF FINITE EXPONENT. ANDREAS BAUDISCH // Bulletin of the London Mathematical Society;Sep2004, Vol. 36 Issue 5, p613 

    The class of nilpotent groups of class $c$ and prime exponent $p\,{>}\,c$ with additional predicates $P_c\,{\subseteq}\,P_{c-1}\,{\subseteq}\,\ldots\,{\subseteq}\,P_1$ for suitable subgroups has the amalgamation property. Hence the Fraïssé limit $D$ of...

  • Quasirecognition by prime graph of L10(2). Khosravi, Behrooz // Siberian Mathematical Journal;Mar2009, Vol. 50 Issue 2, p355 

    Let G be a finite group. The prime graph of G is denoted by Γ( G). The main result we prove is as follows: If G is a finite group such that Γ( G) = Γ( L10(2)) then G/O2( G) is isomorphic to L10(2). In fact we obtain the first example of a finite group with the connected prime graph...

  • On uniform exponential growth for linear groups. Eskin, Alex; Mozes, Shahar; Hee Oh // Inventiones Mathematicae;Apr2005, Vol. 160 Issue 1, p1 

    Discusses the conditions for a finitely generated group to have uniform exponential growth. Finitely generated group which is linear over a field of characteristic 0 and not virtually solvable; Motivations for studying the notion of uniform exponential growth; A version of the ping-pong lemma.

  • ON THE EXPONENT OF LATTICES OVER GROUP RINGS. JONES, ALFREDO // Analele Stiintifice ale Universitatii Ovidius Constanta: Seria M;2015, Vol. 23 Issue 1, p83 

    The article discusses the valuation of exponents in lattices with maximal ideal and finite residue class field in group rings. It considers the discrete valuation ring in finite lattices based on the exponents of their modules. It proves that the splitting trace lattices have the exponential...

  • An Improved Stability Bound for Binary Exponential Backoff. Al-Ammal, H.; Goldberg, L. A.; MacKenzie, P. // Theory of Computing Systems;May/Jun2001, Vol. 34 Issue 3, p229 

    Goodman, Greenberg, Madras and March gave a lower bound of n[sup -Ω(log ] [sup n] ) for the maximum arrival rate for which the n -user binary exponential backoff protocol is stable. Thus, they showed that the protocol is stable as long as the arrival rate is at most n[sup -Ω(log ] [sup n]...

  • Research on ECP3 Mobile-Payment. Hao Tian; Dongsheng Liu // Advances in Information Sciences & Service Sciences;Mar2012, Vol. 4 Issue 5, p1 

    With the development of Mobile-Commerce, mobile-payment turns up. However, compared with the m-commerce in China, mobile-payment is too weak to meet the needs. This paper comes up with the ECP3 Mobile-Payment Solution (Elliptic Curve based Proxy Payment Protocol), which is a proxy payment...


Read the Article


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

Try another library?
Sign out of this library

Other Topics