Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs

Ravilla Dilli, Putta Chandra Shekar Reddy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Message authentication is a mechanism to verity the integrity of a message and it can be achieved using Message Authentication code (MAC) also called as keyed hash function. An ideal Hash algorithm will require a cryptanalytic effort greater than or equal to the brut-force effort. In the recent time, there have been enough efforts in developing cryptanalytic attacks on Hash algorithms. The hash algorithms contain a compression function which takes n-bit input from the chaining variable taken from previous step, b-bit block from the input message and produce an n-bit output. The initial value of chaining variable is specified as part of the algorithm and the final value of the chaining variable becomes hash value or message digest which is attached the message being transmitted. In this paper, we have implemented HMAC-SHA256 and HMAC-SHA512 algorithms for the Data Integrity of the information being sent using a hybrid routing algorithm for Mobile Ad hoc Networks (MANETs). The hybrid routing algorithm which we have taken here is Zone Routing Protocol (ZRP) and the tool used for simulation was NS2.33. The metrics that we have considered to analyze the performance of the protocol were Throughput, Packet delivery fraction and End-to-End Delay.

Original languageEnglish
Title of host publicationProceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages732-735
Number of pages4
ISBN (Electronic)9781509023981
DOIs
Publication statusPublished - 25-04-2017
Event2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016 - Bengaluru, Karnataka, India
Duration: 21-07-201623-07-2016

Conference

Conference2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016
CountryIndia
CityBengaluru, Karnataka
Period21-07-1623-07-16

Fingerprint

Mobile ad hoc networks
Routing protocols
Routing algorithms
Authentication
Hash functions
Throughput
Network protocols

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Signal Processing
  • Software

Cite this

Dilli, R., & Reddy, P. C. S. (2017). Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs. In Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016 (pp. 732-735). [7912096] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICATCCT.2016.7912096
Dilli, Ravilla ; Reddy, Putta Chandra Shekar. / Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs. Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 732-735
@inproceedings{4c042b5972d54165971a652569f64ee5,
title = "Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs",
abstract = "Message authentication is a mechanism to verity the integrity of a message and it can be achieved using Message Authentication code (MAC) also called as keyed hash function. An ideal Hash algorithm will require a cryptanalytic effort greater than or equal to the brut-force effort. In the recent time, there have been enough efforts in developing cryptanalytic attacks on Hash algorithms. The hash algorithms contain a compression function which takes n-bit input from the chaining variable taken from previous step, b-bit block from the input message and produce an n-bit output. The initial value of chaining variable is specified as part of the algorithm and the final value of the chaining variable becomes hash value or message digest which is attached the message being transmitted. In this paper, we have implemented HMAC-SHA256 and HMAC-SHA512 algorithms for the Data Integrity of the information being sent using a hybrid routing algorithm for Mobile Ad hoc Networks (MANETs). The hybrid routing algorithm which we have taken here is Zone Routing Protocol (ZRP) and the tool used for simulation was NS2.33. The metrics that we have considered to analyze the performance of the protocol were Throughput, Packet delivery fraction and End-to-End Delay.",
author = "Ravilla Dilli and Reddy, {Putta Chandra Shekar}",
year = "2017",
month = "4",
day = "25",
doi = "10.1109/ICATCCT.2016.7912096",
language = "English",
pages = "732--735",
booktitle = "Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Dilli, R & Reddy, PCS 2017, Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs. in Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016., 7912096, Institute of Electrical and Electronics Engineers Inc., pp. 732-735, 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016, Bengaluru, Karnataka, India, 21-07-16. https://doi.org/10.1109/ICATCCT.2016.7912096

Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs. / Dilli, Ravilla; Reddy, Putta Chandra Shekar.

Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 732-735 7912096.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs

AU - Dilli, Ravilla

AU - Reddy, Putta Chandra Shekar

PY - 2017/4/25

Y1 - 2017/4/25

N2 - Message authentication is a mechanism to verity the integrity of a message and it can be achieved using Message Authentication code (MAC) also called as keyed hash function. An ideal Hash algorithm will require a cryptanalytic effort greater than or equal to the brut-force effort. In the recent time, there have been enough efforts in developing cryptanalytic attacks on Hash algorithms. The hash algorithms contain a compression function which takes n-bit input from the chaining variable taken from previous step, b-bit block from the input message and produce an n-bit output. The initial value of chaining variable is specified as part of the algorithm and the final value of the chaining variable becomes hash value or message digest which is attached the message being transmitted. In this paper, we have implemented HMAC-SHA256 and HMAC-SHA512 algorithms for the Data Integrity of the information being sent using a hybrid routing algorithm for Mobile Ad hoc Networks (MANETs). The hybrid routing algorithm which we have taken here is Zone Routing Protocol (ZRP) and the tool used for simulation was NS2.33. The metrics that we have considered to analyze the performance of the protocol were Throughput, Packet delivery fraction and End-to-End Delay.

AB - Message authentication is a mechanism to verity the integrity of a message and it can be achieved using Message Authentication code (MAC) also called as keyed hash function. An ideal Hash algorithm will require a cryptanalytic effort greater than or equal to the brut-force effort. In the recent time, there have been enough efforts in developing cryptanalytic attacks on Hash algorithms. The hash algorithms contain a compression function which takes n-bit input from the chaining variable taken from previous step, b-bit block from the input message and produce an n-bit output. The initial value of chaining variable is specified as part of the algorithm and the final value of the chaining variable becomes hash value or message digest which is attached the message being transmitted. In this paper, we have implemented HMAC-SHA256 and HMAC-SHA512 algorithms for the Data Integrity of the information being sent using a hybrid routing algorithm for Mobile Ad hoc Networks (MANETs). The hybrid routing algorithm which we have taken here is Zone Routing Protocol (ZRP) and the tool used for simulation was NS2.33. The metrics that we have considered to analyze the performance of the protocol were Throughput, Packet delivery fraction and End-to-End Delay.

UR - http://www.scopus.com/inward/record.url?scp=85020162463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85020162463&partnerID=8YFLogxK

U2 - 10.1109/ICATCCT.2016.7912096

DO - 10.1109/ICATCCT.2016.7912096

M3 - Conference contribution

SP - 732

EP - 735

BT - Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Dilli R, Reddy PCS. Trade-off between length of the Hash code and performance of hybrid routing protocols in MANETs. In Proceedings of the 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology, iCATccT 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 732-735. 7912096 https://doi.org/10.1109/ICATCCT.2016.7912096