Analysing and Improving Performance and Security of Cryptographically Generated Address Algorithm for Mobile IPv6 Networks

A Cryptographically Generated Address (CGA) is a selfcertifying address that a node generates when it joins a foreign network. Despite its advantages, generating a CGA is computationally expensive. This study examines the security and performance issues related to the use of the CGA Generation algorithm. It also scrutinizes the hash extension mechanism, dierent hash functions and how multithreading can be used to improve the performance of the CGA Generation algorithm. Based on the results, this research recommends imposing a minimal computational security ofO(2 80 ), the use of the HAVAL

[1]  MICHAEL ROE.  Strengthening Short Hash Values , 2007 .

[2]  Willi Meier,et al.  SHA-3 proposal BLAKE , 2009 .

[3]  James H. Davenport,et al.  Cryptographic Hash Functions: Recent Design Trends and Security Notions , 2011, IACR Cryptol. ePrint Arch..

[4]  Christoph Meinel,et al.  CS-CGA: Compact and more Secure CGA , 2011, 2011 17th IEEE International Conference on Networks.

[5]  Christoph Meinel,et al.  Cryptographically Generated Addresses (CGAs): Possible Attacks and Proposed Mitigation Approaches , 2012, 2012 IEEE 12th International Conference on Computer and Information Technology.

[6]  Cheng-Chi Lee,et al.  An improved address ownership in mobile IPv6 , 2008, Comput. Commun..

[8]  Tuomas Aura,et al.  Cryptographically Generated Addresses (CGA) , 2005, ISC.

[9]  Xiaoyun Wang,et al.  Finding Collisions in the Full SHA-1 , 2005, CRYPTO.

[10]  Youngsong Mun,et al.  Design of Modified CGA for Address Auto-configuration and Digital Signature in Hierarchical Mobile Ad-Hoc Network , 2006, ICOIN.

[11]  Mohammad Umar Siddiqi,et al.  An investigation of the merkle signature scheme (MSS) for cryptographically generated address (CGA) signatures in mobile IPv6 , 2014 .

[12]  Gao Xuesong,et al.  A quick CGA generation method , 2010, 2010 2nd International Conference on Future Computer and Communication.

[13]  T. Rajendran,et al.  Hash optimization for cryptographically generated address , 2008, 2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08).

[14]  Christoph Meinel,et al.  Stopping time condition for practical IPv6 Cryptographically Generated Addresses , 2012, The International Conference on Information Network 2012.

[15]  Ronald L. Rivest.  The MD 6 hash function A proposal to NIST for SHA-3 , 2008 .

[16]  Christoph Meinel,et al.  Secure Neighbor Discovery: Review, Challenges, Perspectives, and Recommendations , 2012, IEEE Security & Privacy.

[17]  Christoph Meinel,et al.  Multicore-based auto-scaling SEcure Neighbor Discovery for Windows operating systems , 2012, The International Conference on Information Network 2012.

[18]  Christian Vogt,et al.  Early binding updates for mobile IPv6 , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[19]  Paula Tomlinson.  Multithreaded programming , 1996 .

[20]  W. Marsden.  I and J , 2012 .

[21]  Alex Biryukov,et al.  Non-randomness of the Full 4 and 5-Pass HAVAL , 2004, SCN.

[22]  Tuomas Aura,et al.  Cryptographically Generated Addresses (CGA) , 2005, ISC.

[23]  Jing Li,et al.  Improved Security Mechanism for Mobile IPv6 , 2008, Int. J. Netw. Secur..

[24]  Stefan Lucks,et al.  The Skein Hash Function Family , 2009 .

[25]  Maryline Laurent-Maknavicius,et al.  Significantly improved performances of the cryptographically generated addresses thanks to ECC and GPGPU , 2010, Comput. Secur..

[26]  Jean-Pierre Hubaux,et al.  Analysis and Optimization of Cryptographically Generated Addresses , 2009, ISC.

[27]  K.E. Sreenivasa Murthy,et al.  Security Analysis of Binding Update Protocols in Route Optimization of MIPv6 , 2010, 2010 International Conference on Recent Trends in Information, Telecommunication and Computing.