Skip to main content

Modification of ElGamal Cryptosystem into Data Encryption and Signature Generation

  • Conference paper
  • First Online:
Proceedings of International Conference on Big Data, Machine Learning and Applications

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 180))

Abstract

In the year 1985, Taher ElGamal proposed a new system for encryption and named it as ElGamal public-key cryptosystem. This is considered as one of the most useful security techniques in cryptography. Its security depends on the Diffie–Hellman problem, which internally depends on the discrete logarithm problem. This paper presents an alternate implementation of ElGamal public-key encryption, where a two-tuple ciphertext similar to ElGamal encryption is generated with a difference of using a session key instead of the Diffie–Hellman key to extract the message. Likewise, the ciphertext tuple would be used as a digital signature. Moreover, no security loophole is found in the proposed modification. In addition, the proposed modification has been implemented over the Gaussian integer Z[i] and found to be secured. Finally, it has been claimed that the proposed modification is equally applicable in all security protections where the original ElGamal cryptosystem is used.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. ElGamal Taher (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469–472

    Article  MathSciNet  Google Scholar 

  2. El-Kassar AN et al (2001) El-Gamal public key cryptosystem in the domain of Gaussian integers. Int J Appl Math 7(4):405–412

    MathSciNet  MATH  Google Scholar 

  3. Elkamchouchi H, Elshenawy K, Shaban H (2002) Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers. In: The 8th international conference on communication systems, 2002. ICCS 2002, vol 1. IEEE

    Google Scholar 

  4. Winton, R (2007) Enhancing the Massey-Omura cryptosystem. J Math Sci Math Educ 7(1)

    Google Scholar 

  5. El-Kassar AN, Haraty RA (2005) ElGamal Public-Key cryptosystem in multiplicative groups of quotient rings of polynomials over finite fields. Comput Sci Inf Syst 2(1):63–77

    Google Scholar 

  6. Haraty RA, El-Kassar AN, Shebaro BM (2006) A comparative study of ElGamal based digital signature algorithms. J Comput Methods Sci Eng 6(5, 6 Supplement 1):147–156

    Google Scholar 

  7. Hwang Min-Shiang, Chang Chin-Chen, Hwang Kuo-Feng (2002) An ElGamal-like cryptosystem for enciphering large messages. IEEE Trans Knowl Data Eng 14(2):445–446

    Article  Google Scholar 

  8. Wang M-N et al (2006) Cryptanalysis on an Elgamal-like cryptosystem for encrypting large messages. In: Proceedings of the 6th WSEAS international conference on applied informatics and communications. World Scientific and Engineering Academy and Society (WSEAS), 2006

    Google Scholar 

  9. Chang T-Y, Hwang M-S, Yang W-P (2012) Cryptanalysis on an improved version of ElGamal-like public-key encryption scheme for encrypting large messages. Informatica 23(4):537–562

    Google Scholar 

  10. Dai W (2010) Commutative-like encryption: a new characterization of ElGamal. arXiv:1011.3718

  11. Mohit P, Biswas GP (2015) Design of ElGamal PKC for encryption of large messages. In: 2015 2nd international conference on computing for sustainable global development (INDIACom). IEEE

    Google Scholar 

  12. Mohit P, Biswas GP (2016) Modification of symmetric-key DES into efficient asymmetric-key DES using RSA. In: Proceedings of the second international conference on information and communication technology for competitive strategies. ACM

    Google Scholar 

  13. Mohit P, Biswas GP (2017) Modification of traditional RSA into symmetric-RSA cryptosystems. Int J Busin Data Commun Netw (IJBDCN) 13(1):66–73

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Prerna Mohit .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mohit, P., Biswas, G.P. (2021). Modification of ElGamal Cryptosystem into Data Encryption and Signature Generation. In: Patgiri, R., Bandyopadhyay, S., Balas, V.E. (eds) Proceedings of International Conference on Big Data, Machine Learning and Applications. Lecture Notes in Networks and Systems, vol 180. Springer, Singapore. https://doi.org/10.1007/978-981-33-4788-5_10

Download citation

Publish with us

Policies and ethics