Özet fonksiyon algoritması geliştirme proje önerisi

Download
2008
Doğanaksoy, Ali
Sulak, Fatih
Varıcı, Kerem
Kocair, Çelebi
Atalay, Firuze
Recent years witnessed the continuous works on analysis of cryptographic hash functions which reveal that most of them are not as secure as claimed. Wang et al. presented the first full round collisions on MD4 and RIPEMD using a new attack technique on hash functions which is based on differential cryptanalysis. Then, this attack is further developed and used in the analysis of other famous and widely used hash functions. As a result of these studies, National Institute of Standards and Technology (NIST) announced a public competition of designing a new hash function which will be chosen as the new hash function standard (Secure Hash Algorithm 3, (S HA − 3)). It is expected from new algorithm to provide security bounds for preimage, second-preimage and collision attacks, besides being resistant against all known attack methods. The new hash standard is expected to support variable hash sizes to be used for variable purposes. Moreover, the design should be efficient in both software and hardware implementations. We present a new cryptographic hash function family, Sarmal, which is designed to satisfy all the properties above as a candidate for the S HA − 3 competition. It uses the well known components from block cipher theory to satisfy both security/efficiency trade-off. On the other hand, HAIFA iterative hashing mode is used to prevent latest weaknesses of standard Merkle-Damgård paradigm and provide flexible hash size. Moreover, software implementations reveal that Sarmal can be very efficient on multiple platforms.
Citation Formats
A. Doğanaksoy, F. Sulak, K. Varıcı, Ç. Kocair, and F. Atalay, “Özet fonksiyon algoritması geliştirme proje önerisi,” 2008. Accessed: 00, 2020. [Online]. Available: https://app.trdizin.gov.tr/publication/project/detail/T0RVeE5UVT0.