Secure Key Authentication Scheme Based on Discrete Logarithm and Factoring Problems

  • Azimah SuparlanEmail author
  • Asyura Abd Nassir
  • Nazihah Ismail
  • Fairuz Shohaimay
  • Eddie Shahril Ismail
Conference paper


Protecting public key from being forged or misused by enemies is very important in public key cryptosystems. Thus, key authentication process must be done to ensure that no intrusion occurred. Most researchers develop the key authentication scheme based on a single problem such as factoring, discrete logarithm, elliptic curve discrete logarithm or knapsack. Although some of these systems look secure, but due to technological advancement nowadays, it is possible that intruders can solve the single problem easily. Hence, in this paper we develop a key authentication scheme based on multiple problems; discrete logarithm and factoring problems. This research proposes a scheme with two phases; user registration phase and key authentication phase. The efficiency performance of this scheme requires \(1442T_{\text{mul}} + T_{h} + T_{\text{qrt}}\) for user registration phase and \(481T_{\text{mul}}\) for key authentication phase. Security of the scheme was proven mathematically in the security analysis and it is more secure compared to the scheme that is based on a single problem. This scheme is developed as an alternative to existing key authentication schemes and can contribute towards the development of the cryptography system based on multiple problems.


Key authentication Discrete logarithm Factoring 


  1. Gardon J (1984) Strong RSA key. Electron Lett 20(12):514–516CrossRefGoogle Scholar
  2. Horng G, Yang CS (1996) Key authentication scheme for cryptosystems based on discrete logarithm. Comput Commun 19:848–850CrossRefGoogle Scholar
  3. Ismail ES, Hijazi MSN (2011) A new cryptosystem based on factoring and discrete logarithm problems. J Math Stat 7(3):165–168CrossRefGoogle Scholar
  4. Koblitz N, Menezes A, Vanstone S (2000) The state of elliptic curve cryptography. Des Codes Crypt 19:173–193CrossRefGoogle Scholar
  5. Lee CC, Hwang MS, Li LH (2003) A new key authentication scheme based on discrete logarithms. Appl Math Comput 139:343–349Google Scholar
  6. Peinado A (2004) Cryptanalysis of LHL-key authentication scheme. Appl Math Comput 152:721–724Google Scholar
  7. Scheiner B (1996) Applied cryptography: protocols, algorithms, and source code in C, 2nd edn. WileyGoogle Scholar
  8. Shao Z (2005) A new key authentication scheme for cryptosystems based on discrete logarithms. Appl Math Comput 167:143–152Google Scholar
  9. Sun DZ, Cao ZF, Sun Y (2005) Remarks on a new key authentication scheme based on discrete logarithms. Appl Math Comput 167:572–575Google Scholar
  10. Wu TS, Lin HY (2004) Robust key authentication scheme resistant to public key substitution attacks. Appl Math Comput 157:825–833Google Scholar
  11. Yoon EJ, Yoo KY (2005) On the security of Wu-Lin’s robust key authentication scheme. Appl Math Comput 169:1–7Google Scholar
  12. Yoon EJ, Yoo KY (2008) Robust key authentication scheme. Int J Web Serv Pract 3(1–2):12–18Google Scholar
  13. Zhan B, Li Z, Yang Y, Hu Z (1999) On the security of HY-key authentication scheme. Comput Commun 22:739–741CrossRefGoogle Scholar
  14. Zhang F, Kim K (2005) Cryptanalysis of Lee-Hwang-Li’s key authentication scheme. Appl Math Comput 161:101–107Google Scholar

Copyright information

© Springer Science+Business Media Singapore 2016

Authors and Affiliations

  • Azimah Suparlan
    • 1
    Email author
  • Asyura Abd Nassir
    • 1
  • Nazihah Ismail
    • 1
  • Fairuz Shohaimay
    • 1
  • Eddie Shahril Ismail
    • 2
  1. 1.Faculty of Computer and Mathematical SciencesUniversiti Teknologi MARAJengkaMalaysia
  2. 2.School of Mathematical SciencesUniversiti Kebangsaan MalaysiaBangiMalaysia

Personalised recommendations