Skip to main content

Empirical and Statistical Comparison of RSA and El-Gamal in Terms of Time Complexity

  • Conference paper
  • First Online:
Intelligent Cyber Physical Systems and Internet of Things (ICoICI 2022)

Abstract

In this paper, two algorithms are compared based on their time complexity. The time complexity is defined by encryption and decryption of different message lengths. Time varies for different lengths of messages. We statistically analyzed the time complexity of the algorithm and compared their results.

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 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Jianmin C, Wu J (2005) A survey on cryptography applied to secure mobile ad-hoc networks and wireless sensor networks. In: Proceedings of CRYPTO, pp 27–56

    Google Scholar 

  2. Sharma A, Bhuriya D, Singh U (2015) Secure data transmission on MANET by hybrid cryptography technique. In 2015 International conference on computer, communication, and control (IC4), pp 1–6

    Google Scholar 

  3. Leu S, Chang RS (2012) A weight-value algorithm for finding connected dominating sets in a MANET. J Netw Comput Appl 35(5):1615–1619

    Article  Google Scholar 

  4. Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18(3):331–336

    Article  Google Scholar 

  5. Arora SK, Monga H (2016) Performance evaluation of MANET based on knowledge base algorithm. Optik 127(18):7283–7291

    Article  Google Scholar 

  6. Ahmad SJ, Reddy VSK, Damodaram A, Krishna PR (2015) Delay optimization using the Knapsack algorithm for multimedia traffic over MANETs. Expert Syst Appl 42(20):6819–6827

    Article  Google Scholar 

  7. Hu CC, Lai CF, Hou JG, Huang YM (2017) Timely scheduling algorithm for P2P streaming over MANETs. Comput Netw 127:56–67

    Article  Google Scholar 

  8. Pranav P, Dutta S, Chakraborty S (2021) Empirical and statistical comparison of intermediate steps of AES-128 and RSA in terms of time consumption

    Google Scholar 

  9. Sari PP, Nababan EB, Zarlis M (2020) Comparative study of Luc, ElGamal, and RSA algorithms in encoding texts. In: 2020 3rd international conference on mechanical, electronics, computer, and industrial technology (MECnIT). IEEE, pp. 148–151

    Google Scholar 

  10. Mallouli F, Hellal A, Saeed NS, Alzahrani FA (2019) A survey on cryptography: a comparative study between RSA vs ECC algorithms, and RSA vs El-Gamal algorithms. In: 2019 6th IEEE International conference on cyber security and cloud computing (CSCloud)/2019 5th IEEE international conference on edge computing and scalable cloud (EdgeCom). IEEE, pp 173–176

    Google Scholar 

  11. Jintcharadze E, Iavich M (2020) Hybrid implementation of Twofish, AES, ElGamal, and RSA cryptosystems. In: 2020 IEEE East-West design & test symposium (EWDTS). IEEE, pp 1–5

    Google Scholar 

  12. Iswari NMS (2016) Key generation algorithm design combination of RSA and ElGamal algorithm. In: 2016 8th International conference on information technology and electrical engineering (ICITEE). IEEE, pp 1–5

    Google Scholar 

  13. Pandian AP (2020) Development of secure cloud-based storage using the Elgamal hyper elliptic curve cryptography with fuzzy logic-based integer selection. J Soft Comput Paradigm 2(1):24–35

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ankita Kumari .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumari, A., Pranav, P., Dutta, S., Chakraborty, S. (2023). Empirical and Statistical Comparison of RSA and El-Gamal in Terms of Time Complexity. In: Hemanth, J., Pelusi, D., Chen, J.IZ. (eds) Intelligent Cyber Physical Systems and Internet of Things. ICoICI 2022. Engineering Cyber-Physical Systems and Critical Infrastructures, vol 3. Springer, Cham. https://doi.org/10.1007/978-3-031-18497-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-18497-0_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-18496-3

  • Online ISBN: 978-3-031-18497-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics