Jielin Wang
Abstract
Open-access reader
In this paper, a brand-new hash algorithm is provided. The length of the hash value can be customized. It is theoretically proved that the hash collision limit can be reached. The algorithm can be applied flexibly, and it can be applied to digital signatures, document verification and other fields in the future.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a brand-new hash algorithm is provided. The length of the hash value can be customized. It is theoretically proved that the hash collision limit can be reached. The algorithm can be applied flexibly, and it can be applied to digital signatures, document verification and other fields in the future.
Key concepts: Hash function, Computer science, Algorithm, Limit (mathematics), SHA-2, Secure Hash Algorithm, Double hashing, Digital signature