Skip to main content

An Improved Pig Latin Algorithm for Lightweight Cryptography

  • Conference paper
  • First Online:
Advances in Computational Intelligence

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 988))

Abstract

The security of data transmitted has paramount significance in the exchange and storage of information. Cryptography provides a solution to a lot of real-world data security problems over digital communication channels. While cryptographic algorithms are not the only requirement for providing security, but these are the first step toward providing the required security over data transmission and communication. Cryptography is the science of keeping messages secure from unauthorized recipients. In this paper, we present a new cryptographic algorithm which is an amalgamated version of Pig Latin, a popular argot or jargon and RSA, one of the most popular asymmetric key cryptosystems. The modified Pig Latin involves a layer of encryption using the cryptographic algorithm RSA to provide better security than RSA alone, thereby increasing the security. The practical performance of the algorithm is analyzed in terms of its empirical computational complexity. There are several cryptographic algorithms which are used to secure information in the form of encryption and decryption. The running time of the proposed algorithm is compared with a present cryptographic algorithm AES-128. Because of the simplicity of the algorithm, it can be implemented for messaging applications used in mobile phones and to secure data stored on other small storage devices.

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.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. M.M. Rahman, T. Akter, A. Rahman, Development of cryptography-based secure messaging system. J. Telecommun. Syst. Manage. 5, 142 (2016). https://doi.org/10.4172/2167-0919.1000142

    Article  Google Scholar 

  2. H. Bodur, R. Kara, Secure SMS Encryption Using RSA Encryption Algorithm on Android Message Application (2015)

    Google Scholar 

  3. S. Ariffi, R. Mahmod, R. Rahmat, N.A. Idris, in SMS encryption using 3D-AES block cipher on android message application. Proceedings of the 2013 international conference on advanced computer science applications and technologies, ACSAT 2013 (2013), pp. 310–314. https://doi.org/10.1109/acsat.2013.68

  4. Shikhar Bhagoliwal, Jyotirmoy Karjee, Securing mobile data using cryptography. Int. J. Adv. Networking Appl. 7, 2925–2930 (2016)

    Google Scholar 

  5. S. Chakraborty, P.P. Choudhury, A statistical analysis of an algorithm’s complexity. Appl. Math. Lett. 13, 121–126 (2000)

    Article  MathSciNet  Google Scholar 

  6. D.E. Knuth, Fundamental Algorithms, vol. 1 (Addison-Wesley, 1973)

    Google Scholar 

  7. S. Chakraborty, K.K. Sundararajan, A simple empirical formula for categorizing computing operation. Appl. Math. Comput. 187, 326–340 (2007)

    Article  MathSciNet  Google Scholar 

  8. S.K. Sourabh, S. Chakraborty, Empirical O(n2) complexity is convincingly gettable with two dense matrix in n × n matrix multiplication. InterStat (2006)

    Google Scholar 

  9. S.C. Gupta, V.K. Kapoor, Fundamental of Mathematical statistics (Sultan Chand & Sons)

    Google Scholar 

  10. S.F. Goldsmith, A.S. Aiken, D.S. Wilkerson, Measuring Emirical Coputational Complexity (ACM, 2007)

    Google Scholar 

  11. S. Chakraborty, S.K. Sourabh, A Computer Experiment Oriented Approach to Algorithmic Complexity (Lap Lambert Academic, 2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sandip Dutta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dutta, S., Sinha, S. (2020). An Improved Pig Latin Algorithm for Lightweight Cryptography. In: Sahana, S., Bhattacharjee, V. (eds) Advances in Computational Intelligence. Advances in Intelligent Systems and Computing, vol 988. Springer, Singapore. https://doi.org/10.1007/978-981-13-8222-2_28

Download citation

Publish with us

Policies and ethics