원문정보
초록
영어
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.
목차
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