A Novel Secured Cryptographic Hash (NSCH) Algorithm
暂无分享,去创建一个
Cryptographic hash algorithms are utilized to create a message digest of unique fixed length bit string for the arbitrarily length of the data. Hash functions are considered to be tools, which are used in digital time stamping, digital signatures, and assuring the integrity of the messages. The data that has been outsourced need to be periodically verified that whether the data has been modified by anonymous user or not. In this paper, a novel idea has been proposed for creating a unique message digest of any message by addressing the data integrity problem. A comparison has been made with the existing cryptographic hashing tool MD5, modified approach on MD5 [1] and our proposed efficient algorithm. In the NSCH algorithm, the randomness of the message digest for the input message has been increased which has been proved and justified in the experimental results. Keywords—Cryptography; Hash; MD5; message digest; digital signature
[1] Ronald L. Rivest,et al. The MD5 Message-Digest Algorithm , 1992, RFC.
[2] Rakesh Mohanty,et al. A secured Cryptographic Hashing Algorithm , 2010, ArXiv.
[3] Xiaoyun Wang,et al. How to Break MD5 and Other Hash Functions , 2005, EUROCRYPT.
[4] Florian Mendel,et al. MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners , 2009, ASIACRYPT.
[5] Antoon Bosselaers,et al. Collisions for the Compressin Function of MD5 , 1994, EUROCRYPT.