Enhanced SHA-192 Algorithm with Larger Bit Difference

Gupta, Govind; Sharma, Sanjeev

doi:10.1109/csnt.2013.42

Cited by 10 publications

(9 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem will lead to the possibility of having two different input that will yield the same output value in the middle of algorithm or compression function [20] [28]. Therefore, it is necessary to design a function with better diffusion to spread the output in each round and prevent the same output in the next coming stages [20], [29]- [30].…”

Section: Introductionmentioning

confidence: 99%

Modified SHA-1 Algorithm

Quilala¹,

Sison²,

Medina³

2018

IJEECS

View full text Add to dashboard Cite

Hashes are used to check the integrity of data. This paper modified SHA-1 by incorporating mixing method in every round for better diffusion. The modification increased the hash output to 192-bits. Increasing the output increases the strength because breaking the hash takes longer. Based on the different message types, avalanche percentage of modified SHA-1 showed better diffusion at 51.64%, higher than the target 50%, while SHA-1 achieved 46.61%. The average execution time noted for modified SHA-1 is 0.33 seconds while SHA-1 is 0.08 seconds. Time increases as the number of messages hashed increases; the difference is negligible in fewer messages. <a name="_Hlk507405879"></a>On character hits, that is - no same character in the same position, modified SHA-1 achieved lower hit rate because of the mixing method added. The modifications’ effectiveness was also evaluated using a hash test program. After inputting 1000 hashes from random strings, the result shows no duplicate hash.

show abstract

Section: Introductionmentioning

confidence: 99%

Modified SHA-1 Algorithm

Quilala¹,

Sison²,

Medina³

2018

IJEECS

View full text Add to dashboard Cite

show abstract

“…This problem will lead to the chance of having two different input that will generate the same output value in the middle of algorithm or compression function [30], [31]. Hence, there is a need to devise a function with improved diffusion to distribute the output in each round and prevent the same in the next coming stages [32], [33], [30].…”

Section: Introductionmentioning

confidence: 99%

“…Some studies made proposed enhancements on SHA-1 aimed to attain additional diffusion [34], [35] but did not show the bit-difference on the simulation of result or have shown lower bit difference. Another incorporated MD5 to SHA-1 [32], but this approach will suffer from the same vulnerability [36], [37]. Another study has not included actual messages used during the experiment [38].…”

Section: Introductionmentioning

confidence: 99%

QR Code Integrity Verification Based on Modified SHA-1 Algorithm

Quilala¹,

Sison²,

Medina³

2018

IJEEI

View full text Add to dashboard Cite

The modified SHA-1 algorithm was applied in the data integrity verification process of certificates with QR code technology. This paper identified the requirements needed in the certificate verification that uses the modified SHA-1. The application was tested using legitimate and fraudulent certificates. Based on the results, the application successfully generated QR codes, printed certificates, and verified certificates with 100% accuracy. During the trial run of the application, four test cases were seen which involves correct names and QR codes, and three other possible test cases of faking certificates such as modification of the name, regeneration of QR codes using valid hash and a fake name, and modification of the QR code. Although these cases exist, the application successfully verified all thirty certificates correctly. Also, it is noticed that during the scanning, the smartphone camera should be in focus to capture the QR code clearly.

show abstract

“…In [1], Authors have merged the SHA-192 and MD-5 and proposed their own algorithm. This algorithm also generates a digest of 192 bits.…”

Section: Introductionmentioning

confidence: 99%

“…It should be infeasible to find two different messages with the same hash. [1,10] There are many cryptographic hash algorithms: MD4, MD5, SHA-0, SHA-1 and SHA-2, but all these algorithms are either not secure or not efficient in terms of time. Hash algorithm uses a message and generates a message digest of fixed length.…”

Section: Introductionmentioning

confidence: 99%

Secure and Efficient Integrity Algorithm based on Existing SHA Algorithms

Soni¹,

Singh²

2015

IJCA

View full text Add to dashboard Cite

In today's world every person relies on internet for various purposes. There is always a need to take appropriate measures for getting secure communication all the way throughout this unsecure internet. Integrity is one of the most significant factors in the communication scenario. There are various algorithms that ensure the integrity but almost all are either not secure or not efficient. This paper highlights some of such algorithms and also introduces an integrity algorithm and also proves its efficiency with its implementation result.

show abstract

Enhanced SHA-192 Algorithm with Larger Bit Difference

Cited by 10 publications

References 4 publications

Modified SHA-1 Algorithm

Modified SHA-1 Algorithm

QR Code Integrity Verification Based on Modified SHA-1 Algorithm

Secure and Efficient Integrity Algorithm based on Existing SHA Algorithms

Contact Info

Product

Resources

About