Earticle

초록

영어

Security of precious data is the most critical design parameter of a communication network. Applications like online banking and military information exchange requires more concern over security regardless of other design issues like power and energy consumption. Data alterations in some applications can lead to severe irreparable losses. This paper presents a novel and reliable Hash algorithm which inherits the basic architecture of MD5. Performance of proposed technique is compared with existing MD5, SHA-160, SHA-256 and SHA-384 techniques through statistical test suite for random numbers. Results reveal that the suggested technique is more effective in terms of randomness than the MD5, SHA-160, SHA-256 and SHA-384. The proposed technique thus finds its applicability in the sensitive data environment.

목차

Abstract
 1. Introduction
 2. Proposed Algorithm
  2.1. Pre-Processing Step
  2.2. ‘F’ Function
  2.3. Generation of Message Digest
  2.4. Processing of Proposed Algorithm
 3. Results and Discussions
  3.1. Frequency Test
  3.2. Run Test
  3.3. Binary Derivative Test (BDT)
  3.4. Avalanche Test
  3.5. Random Excursion Variant Test
  3.6. Throughput
 4. Conclusion
 References

키워드

저자

• Vikas Dhawan [ Discipline of Electronics & Communication Engineering, Lovely Professional University, Jalandhar, India ]
• Gurjot Singh Gaba [ Discipline of Electronics & Communication Engineering, Lovely Professional University, Jalandhar, India ] Corresponding author

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605