Skip to main content

Shared Memory Implementation and Scalability Analysis of Recursive Positional Substitution Based on Prime-Non Prime Encryption Technique

  • Conference paper
  • First Online:
Computational Intelligence, Communications, and Business Analytics (CICBA 2018)

Abstract

The paper reports shared memory implementation of Recursive Positional Substitution Based on Prime-Nonprime (RPSP) algorithm using OpenMP application programming interface. Recursive Positional Substitution Based on Prime-Nonprime (RPSP) is a secret-key cryptosystem that helps to protect electronic data, while transmitting over internet. Cryptography provides techniques for information authenticity, confidentiality and integrity, but at the same time implementing cryptographic algorithm involves challenges such as speed of execution, processor and memory requirements. Shared memory implementation of cryptographic algorithms exploiting the immense computational power provided by modern multicore architecture improves the performance of these algorithms. This paper proposes a parallel programming model of RPSP algorithm using OpenMP directives, runtime library routines and environment variables. Scalability analysis of the proposed parallel algorithm has been presented for encryption/decryption of different sizes of standard image eso1705a taken from the database provided online by European Southern Observatory(ESO). Results obtained confirm approximately linear scalability for both encryption/decryption phases of the parallelized algorithms.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Dutta, S., Mandal, J.K.: An approach to ensure information security through 252-bit integrated encryption system (IES). IACR Cryptology ePrint Archive, p. 360 (2008)

    Google Scholar 

  2. Dutta, S.: An approach towards development of efficient encryption technique. Ph.D. thesis. University of North Bengal, India (2004)

    Google Scholar 

  3. Dasgupta, M., Mandal, J.K.: Bit-plane oriented image encryption through prime-nonprime based positional substitution (BPIEPNPS). Int. J. Comput. Sci. Eng. 4(6), 65–70 (2016)

    Google Scholar 

  4. Sathawane, V., Diwan, T.: An optimized parallel computation of advanced encryption algorithm using open MP - a review. Int. J. Adv. Res. Comput. Commun. Eng. 5(2), 384–386 (2016)

    Google Scholar 

  5. Nagendra, M., Sekhar, M.C.: Performance improvement of advanced encryption algorithm using parallel computation. Int. J. Softw. Eng. Appl. 8(2), 287–296 (2014)

    Google Scholar 

  6. Kasahara, H., Narita, S.: Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans. Comput. 33(11), 1023–1029 (1984)

    Article  Google Scholar 

  7. Harika, A.V., Saranya, T., Moorthi, M.N.: Performance analysis of encryption algorithm for network security on parallel computing environment. Int. J. Sci. Res. Dev. 7(18), 9–9873 (2014)

    Google Scholar 

  8. Liu, B., Baas, B.M.: Parallel AES encryption engines for many-core processor arrays. IEEE Trans. Comput. 62(3), 536–547 (2013)

    Article  MathSciNet  Google Scholar 

  9. Ansari, Z., Afzal, A., Muhiuddeen, M., Nayak, S.: Literature survey for the comparative study of various high performance computing techniques. Int. J. Comput. Trends Technol. (IJCTT) 27(2), 80–86 (2015)

    Article  Google Scholar 

  10. Source. http://www.eso.org/public/images/eso1705a/

  11. Chandra, R.: Parallel Programming in OpenMP. Morgan Kaufmann, Burlington (2001)

    Google Scholar 

  12. Chapman, B., Jost, G., Van Der Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming. MIT Press, Cambridge (2008)

    Google Scholar 

  13. Mattson, T.G., Sanders, B., Massingill, B.: Patterns for Parallel Programming. Pearson Education, London (2004)

    MATH  Google Scholar 

  14. Kim, J., Yoo, T., Yeom, Y., Yi, O.: New entropy source for cryptographic modules using openMP in multicore CPUs. Int. J. Secur. Appl. 7(4), 445–452 (2013)

    Google Scholar 

  15. Tudor, B. M., Teo, Y. M.: A practical approach for performance analysis of shared-memory programs. In: 2011 IEEE International Parallel & Distributed Processing Symposium (IPDPS), pp. 652–663 (2011)

    Google Scholar 

Download references

Acknowledgments

One of the authors Gaurav Gambhir is grateful to Emeritus Professor Pradosh K. Roy for his technical guidance and invaluable suggestions in preparation of the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gaurav Gambhir .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gambhir, G., Mandal, J.K. (2019). Shared Memory Implementation and Scalability Analysis of Recursive Positional Substitution Based on Prime-Non Prime Encryption Technique. In: Mandal, J., Mukhopadhyay, S., Dutta, P., Dasgupta, K. (eds) Computational Intelligence, Communications, and Business Analytics. CICBA 2018. Communications in Computer and Information Science, vol 1031. Springer, Singapore. https://doi.org/10.1007/978-981-13-8581-0_35

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-8581-0_35

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-8580-3

  • Online ISBN: 978-981-13-8581-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics