一种安全的密码散列算法
A secured Cryptographic Hashing Algorithm
摘要：
几十年来，用于计算消息的消息摘要的加密散列函数作为维护消息完整性的有效措施已经在实际中使用。此消息摘要是唯一的、不可逆的，并避免了任何给定输入字符串的所有类型的冲突。从该算法计算的消息摘要与来自发送方侧的原始消息一起在通信介质中传播，并且在接收方侧，可以通过重新计算接收到的消息的消息摘要并比较两个摘要值来验证消息的完整性。本文设计和发展了一种新的计算任何消息的消息摘要的算法，并用高级程序设计语言实现了它。实验分析和比较现有的MD5散列算法，这是主要被用作密码散列工具，表明该算法提供更大的随机性和更大的强度从入侵攻击。在该算法中，明文消息串被转换成二进制串，并在用用户定义的填充位填充后被分段成128位的块。然后，使用伪随机数生成器，为每个块生成密钥，并通过逐位运算符对相应的块进行运算。对整个消息重复这个过程，最后得到固定长度的消息摘要。
英文摘要：
Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the original message from the sender side and on the receiver side integrity of the message can be verified by recalculating the message digest of the received message and comparing the two digest values. In this paper we have designed and developed a new algorithm for calculating the message digest of any message and implemented t using a high level programming language. An experimental analysis and comparison with the existing MD5 hashing algorithm, which is predominantly being used as a cryptographic hashing tool, shows this algorithm to provide more randomness and greater strength from intrusion attacks. In this algorithm the plaintext message string is converted into binary string and fragmented into blocks of 128 bits after being padded with user defined padding bits. Then using a pseudo random number generator a key is generated for each block and operated with the respective block by a bitwise operator. This process is terated for the whole message and finally a fixed length message digest is obtained.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
