Advertisement

Public Network Security by Bluffing the Intruders Through Encryption Over Encryption Using Public Key Cryptography Method

  • Vishu Madaan
  • Dimple Sethi
  • Prateek AgrawalEmail author
  • Leena Jain
  • Ranjit Kaur
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 712)

Abstract

Cryptography and network security is the concept of protecting the network and data transmission. Security of data is important, as data is transferred over unreliable network. Public-key cryptography provides optimal solutions to many of the existing security issues in communication systems. In our proposed algorithm we have used some of these secure algorithms in order to generate a highly secured algorithm which can deal with the various flaws of these algorithms. RSA, Reil-fence algorithm, substitution and transposition algorithms has been used in the proposed algorithm. Encryption over encryption is done in order to confuse the intruder. The proposed algorithm is used to provide multilevel security.

Keywords

RSA algorithm Reil-fence algorithm Public key cryptography Encryption over encryption 

References

  1. 1.
    Appadwedula, S., Veeravalli, V.V., Jones, D.L.: Energy-efficient detection in sensor networks. IEEE J. Sel. Areas Commun. 23(4), 693–702 (2005)CrossRefGoogle Scholar
  2. 2.
    Bertsekas, D.: Dynamic Programming and Optimal Control, vol. I and II. Athena Scientific, Belmont (1995)zbMATHGoogle Scholar
  3. 3.
    Hernández-Lerma, O., Lasserre, J.B.: Discrete-Time Markov Control Processes: Basic Optimality Criteria. Springer, New York (1996)CrossRefzbMATHGoogle Scholar
  4. 4.
    Lehmann, E.L., Casella, G.: Theory of Point Estimation. Springer, New York (1998)zbMATHGoogle Scholar
  5. 5.
    Prasanthi, V.K., Kumar, A.: Optimizing delay in sequential change detection on ad hoc wireless sensor networks. In: IEEE SECON, VA, USA, pp. 306–315, September 2006Google Scholar
  6. 6.
    Rago, C., Willet, P., Bar-Shalom, Y.: Censoring sensors: a low communication-rate scheme for distributed detection. IEEE Trans. Aerosp. Electron. Syst. 32(2), 554–568 (1996)CrossRefGoogle Scholar
  7. 7.
    Shiryaev, A.N.: Optimal Stopping Rules. Springer, New York (1978)zbMATHGoogle Scholar
  8. 8.
    Veeravalli, V.V.: Decentralized quickest change detection. IEEE Trans. Inf. Theory 47(4), 1657–1665 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Wu, Y., Fahmy, S., Shroff, N.B.: Energy efficient sleep/wake scheduling for multi-hop sensor networks: non-convexity and approximation algorithm. IEEE Infocom 07, 1568–1576 (2007)CrossRefGoogle Scholar
  10. 10.
    Zacharias, L., Sundaresan, R.: Decentralized sequential change detection using physical layer fusion. IEEE Trans. Wirel. Commun. 7(12), 4999–5008 (2007)CrossRefGoogle Scholar
  11. 11.
    Omari, M.: An efficient application of a dynamic crypto system in mobile wireless security. In: IEEE International Conference on Wireless Communications and Networking, pp. 837–842 (2004)Google Scholar
  12. 12.
    Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  • Vishu Madaan
    • 1
  • Dimple Sethi
    • 1
  • Prateek Agrawal
    • 1
    Email author
  • Leena Jain
    • 2
  • Ranjit Kaur
    • 1
  1. 1.Lovely Professional UniversityPhagwaraIndia
  2. 2.Global Institute of Management and Emerging TechnologiesAmritsarIndia

Personalised recommendations