Volume-5 , Issue-5 , Oct 2017, ISSN 2321-3256 (Electronic Version) Go Back

• Open Access   Article

  Synthesis of Cryptography and Security Attacks

  M. Arora, S. Sharma

  Review Paper | Journal (IJSRNSC)

  Vol.5 , Issue.5 , pp.1-5, Oct-2017

  CrossRef-DOI:   https://doi.org/10.26438/ijsrnsc/v5i5.15

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  In the era of digital media safeguarding of a mechanized orientation system in order to accomplish the applicable objectives of conserving the uprightness, possibility and discretion plays an essential role. There is compilation of tools intended to guard data and to prevent hackers but still there is a peril of multifarious attacks on information. This document brings into light the aspects of security and attack on cryptographic techniques. In it we have examined diverse types of attacks feasible on cryptography. In due course, I have gauged some eminent contemporary cryptographic algorithms in search for the finest compromise in security.

  Key-Words / Index Term
  

  References
  [1]. T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only. Computers”, IEEE Transactions , Vol.C-34 Issue.1pp.81–85, 1985.
  [2]. A. Canteaut, “Correlation attack for stream ciphers”, Encyclopedia of Cryptography and Security, pp. 261–262. Springer US, 2011.
  [3]. J. Hoch and A.Shamir, “Fault analysis of stream ciphers”, In Chryptographic Hardware and Embedded Systems CHES 2004, Lecture Notes in Computer Science, pp. 240–253. Springer-Verlag, 2004.
  [4]. D.Coppersmith, S. Halevi, and C.Jutla, “Cryptanalysis of stream ciphers with linear masking”,. In Moti Yung, editor, Advances in Cryptology CRYPTO 2002, Vol. 2442 of Lecture Notes in Computer Science, pp. 515–532. Springer- Berlin Heidelberg, 2002.
  [5]. I.Dinur and A.Shamir , “Cube attacks on tweakable black box polynomials”, In Antoine Joux, editor, Advances in Cryptology – EUROCRYPT 2009, Vol. 5479 Lecture Notes in Computer Science, pp. 278–299. Springer- Berlin Heidelberg, 2009.
  [6]. I.Dinur and A. Shamir, “Applying cube attacks to stream ciphers in realistic scenarios”, Cryptography and Communications, Vol.4 Issue.3 pp.217–232, 2012.
  [7]. H. Ahmadi and T. Eghlidos, ”Heuristic guess-and-determine attacks on stream ciphers” Information Security, IET, Vol.3 Issue.2 pp.66–73, 2009.
  [8]. E.Pasalic, “On guess and determine cryptanalysis of lfsr-based stream ciphers”, Information Theory, IEEE Transactions , Vol.55 Issue.7 pp.3398–3406, 2009.
  [9]. Kaliski, Burton S., M. Robshaw, “Linear Cryptanalysis Using Multiple Approximations” CRYPTO 1994: pp26–39
  [10]. D. Bhowmik, A. Datta, A. Sinha, “A New Perspective of Inferring from the output of Linear Cryptanalysis Attack”, International Journal of Computer Sciences and Engineering, Vol.5, Issue.2, pp.38-42, 2017.
  [11]. M.Matsui, “The First Experimental Cryptanalysis of the Data Encryption Standard”, Lecture Notes in Computer Science Vol.839 pp. 1–11,1994.
  [12]. E.Biham, A.Biryukov, “An Improvement of Davies’ Attack on DES”. J. Cryptology Vol.10 Issue.3 pp. 195–206, 1997
  [13]. S. Sharma and Jeevan Singh Bisht, “Performance Analysis of Data Encryption Algorithms”, International Journal of Scientific Research in Network Security and Communication, Vol.3, Issue.1, pp.1-5, 2015.
  [14]. Paul C. van Oorschot and Michael J. Wiener, “A Known-Plaintext Attack on Two-Key Triple Encryption”, Advances in cryptology, proceedings of EUROCRYPT’90, LNCS 473, pp 318-325,1990
  [15]. L.R. Mathew, “A Survey on Different Cryptographic Techniques”, International Journal of Computer Sciences and Engineering, Vol.5, Issue.2, pp.27-29, 2017.
  [16]. Schneier B, “The Blowfish Encryption Algorithm”, Dr. Dobb’s Journal,Vol.19,Issue 4, pp .38-40,1994.
  [17]. O. Kara and C. Manap, “A New Class of Weak Keys for Blowfish" , (PDF). FSE 2007.
  [18]. V. Rijmen "Cryptanalysis and Design of Iterated Block Ciphers" Ph.D thesis,1997
  [19]. M. Adams. "Constructing Symmetric Ciphers Using the CAST Design Procedure", Designs, Codes, and Cryptography (12), pp283–316,1997
  [20]. J.Nakahara Jr, M. Rasmussen, “ Linear Analysis of Reduced- Round CAST-128 and CAST-256”SBSEG,pp 45-55,2007
  [21]. A. Biryukov and E. Kushilevitz. “ Improved Cryptanalysis of RC5” EUROCRYPT 1998.
  [22]. Mewada S, Sharma P, Gautam SS., “Exploration of efficient symmetric algorithms”. 3rd International Conference on Computing for Sustainable Global Development (INDIACom), India, pp. 663-666, 2016.
  

  Citation
  M. Arora, S. Sharma, "Synthesis of Cryptography and Security Attacks," International Journal of Scientific Research in Network Security and Communication, Vol.5, Issue.5, pp.1-5, 2017

• Open Access   Article

  Drop of RERR Leads Routing Loop in AODV

  Rajesh Dhakad, Abhinesh Kumar

  Research Paper | Journal (IJSRNSC)

  Vol.5 , Issue.5 , pp.6-9, Oct-2017

  CrossRef-DOI:   https://doi.org/10.26438/ijsrnsc/v5i5.69

  Abstract

  Full-Text HTML

  References

  Citation

  Abstract
  Ad-hoc networks are infrastructure less multihop wireless network. In ad-hoc network routes are provided by wireless nodes. Wireless nodes are free to move randomly on any direction with random speed. Ad-hoc networks with mobility are considered as MANETs. In ad-hoc network each node can act as a hop and router itself or both at the same time. Which make routing difficult, to deal with this problem routing protocol required. Ad-hoc On-Demand Distance Vector (AODV) is one of the simplest, efficient, and effective reactive routing protocol developed for MANETs. To maintain routes in wireless ad-hoc networks. AODV use some control messages to manage communication in between nodes. Route Request Message (RREQ) disseminated along with source sequence number through a node to discover a route, Route Reply Message (RREP) uni-casted along with destination sequence number back to source node, HELLO message used to detect and monitor link and Route Error Message (RERR) disseminated to inform all nodes when link failure occur in the network. To keep route information readily available and low routing overhead, AODV maintain route caching but some times cache not removed due to drop, collision and failure of control messages and route cache become stale. This stale cache leads routing loop in ad-hoc network. After detailed study of RFC 3561 & most of the research work done in past. It is commonly known in AODV routing protocol that sequence number are sufficient to protect networks from count to infinity problem. But in this research work implementation to be done to provide a valid proof of routing loop on the simulator. The purpose of this research is to identify flaw so in future we can get more reliable routing protocol.

  Key-Words / Index Term
  AODV; MANETs; REQ; RREP; RERR; Loop Formation; Routing Protocols

  References
  [1] N. H. Saeed, M. F. Abbod, and H. S. Al-Raweshidy. Manet routing protocols tax- onomy. In 2012 International Conference on Future Communication Networks, pages 123128, April 2012.
  [2] K. Subramanian, R. Gnanakumaran , "Analysis of Power Complexity in Existing Algorithms Against Ad-Hoc On demand Distance Vector Routing Protocol (AODV)", International Journal of Computer Sciences and Engineering, Vol.4, Issue.12, pp.36-45, 2016.
  [3] Charles E. Perkins and Pravin Bhagwat. Highly dynamic destinationsequenced distance-vector routing (dsdv) for mobile computers. In Proceedings of the Conference on Communications Architectures, Protocols and Applications, SIGCOMM 94, pages 234244, New York, NY, USA, 1994. ACM.
  [4] P.W. Dkhar, R. Khongthaw, "Survey Paper on DSDV and AODV Routing Protocol of MANET", International Journal of Computer Sciences and Engineering, Vol.5, Issue.3, pp.69-74, 2017.
  [5] P. Mutalik, Nagaraj S, Vedavyas J, R. V. Biradar, and V. G. C.
  Patil. A comparative study on aodv, dsr and dsdv routing protocols for intelligent transportation system (its) in metro cities for road traffic safety using vanet route traffic analysis (vrta). In 2016 IEEE International Conference on Advances in Electronics, Communication and Computer Technology (ICAECCT), pages 383386, Dec 2016.
  [6] C. Mbarushimana and A. Shahrabi. Comparative study of reactive and proactive routing protocols performance in mobile ad hoc networks. In Advanced Information Networking and Applications Workshops, 2007, AINAW ’07. 21st International Conference on , volume 2, pages 679–684, May 2007.
  [7] H. Rangarajan and J. J. Garcia-Luna-Aceves, ”Achieving loop-free incremental routing in ad hoc networks,” Proceedings. ISCC 2004. Ninth International Symposium on Computers and Communications (IEEE Cat. No.04TH8769), 2004, pp. 182-187 Vol.1. doi:10.1109/ISCC.2004.1358402
  [8] Leena Pal, Pradeep Sharma, Netram Kaurav and Shivlal Mewada, "Performance Analysis of Reactive and Proactive Routing Protocols for Mobile Ad-hoc –Networks", International Journal of Scientific Research in Network Security and Communication, Vol.1, Issue.5, pp.1-4, 2013.
  [9] M. Velempini and M. E. Dlodlo. A virtual ad hoc routing algorithm for manets. In The 2nd International Conference on Wireless Broadband and Ul-tra Wideband Communications (AusWireless 2007), pages 2222, Aug 2007.
  [10] Harishbabu.Kalidasu ,Srikanth.Gummadi, Regula Srilakshmi, Caching Strategies In Manet Using Dsr And Aodv Routing Protocols, Sep-13 Vol.1 Issue.9 , International Journal on Recent and Innovation Trends in Computing and Communication (IJRITCC), ISSN: 2321-8169, PP: 697-699
  [11] Rob van Glabbeek, Peter Hofner, Wee Lum Tan, and Marius Portmann. Sequence numbers do not guarantee loop freedom: Aodv can yield routing loops. In Proceedings of the 16th ACM International Conference on Modeling, Analysis & Simulation of Wireless and Mobile Systems, MSWiM 13, pages 91100, New York, NY, USA, 2013. ACM.
  [12] M. Zhou, H. Yang, X. Zhang and J. Wang, ”The proof of AODV loop freedom,” 2009 International Conference on Wireless Communications Signal Processing, Nanjing, 2009, pp. 1-5. doi: 10.1109/WCSP.2009.5371479
  [13] Umesh Kumar Singh, Jalaj Patidar and Kailash Chandra Phuleriya, "On Mechanism to Prevent Cooperative Black Hole Attack in Mobile Ad Hoc Networks", International Journal of Scientific Research in Computer Science and Engineering, Vol.3, Issue.1, pp.11-15, 2015.
  [14] S. Chettibi, Y. Labeni, and A. Boulkour. Trace file analyzer for adhoc routing protocols simulation with ns2. In 2015 First International Conference on New Technologies of Information and Communication (NTIC) , pages 16, Nov 2015.
  [15] J. Zhang,W. Li, D. Cui, X. Zhao, and Z. Yin. The ns2-based simulation and research on wireless sensor network route protocol. In 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing , pages 14, Sept 2009.
  

  Citation
  Rajesh Dhakad, Abhinesh Kumar, "Drop of RERR Leads Routing Loop in AODV," International Journal of Scientific Research in Network Security and Communication, Vol.5, Issue.5, pp.6-9, 2017