An Improved Hash Function Based on the Tillich-Zémor Hash Function

نویسندگان

  • Ahmad Gaeini Department of Mathematics, Faculty of Science, Imam Hossein Comprehensive University, Tehran, I. R. Iran
  • Zohreh Mostaghim Cryptography and Data Security Laboratory, School of Mathematics, Iran University of Science and Technology, Tehran, I. R. Iran
چکیده مقاله:

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preimages for the Tillich-Zémor Hash Function

After 15 years of unsuccessful cryptanalysis attempts by the research community, Grassl et al. have recently broken the collision resistance property of the TillichZémor hash function. In this paper, we extend their cryptanalytic work and consider the preimage resistance of the function. We present two algorithms for computing preimages, each algorithm having its own advantages in terms of spee...

متن کامل

Hardware Implementations of a Variant of the Zémor-Tillich Hash Function: Can a Provably Secure Hash Function be very efficient ?

Hash functions are widely used in Cryptography, and hardware implementations of hash functions are of interest in a variety of contexts such as speeding up the computations of a network server or providing authentication in small electronic devices such as RFID tags. Provably secure hash functions, the security of which relies on the hardness of a mathematical problem, are particularly appealin...

متن کامل

Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function

Recent breakthroughs concerning the current standard SHA-1 prompted NIST to launch a competition for a new secure hash algorithm [1,13]. Provably secure hash functions (in the sense that their security relates to the hardness of some mathematical problems [5,7,9,12]) are particularly interesting from a theoretical point of view but are often much slower than heuristic functions like SHA. In thi...

متن کامل

Improved Reversible Watermarking Using Hash Function

Protection of digital multimedia contents, as well as security and privacy have become a major challenge due to the recent advances in the fields of networking, and digital multimedia, as well as the readily availability of copying and manipulative devices and software programs to the public. One possible explanation is that the traditional wavelet transform coefficients are more sensitive to f...

متن کامل

Hash Function Designs Based on Stream Ciphers

Hash functions are fundamental components of many cryptographic applications. Due to the recent attacks on classical designs, alternative design approaches are proposed. In this paper, we give a survey for hash function constructions based stream ciphers mainly concentrating on Panama, RadioGatún and RC4-hash. Also, we propose an example hash function Dragon-Hash based on the stream cipher Dragon.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 3  شماره 2

صفحات  81- 87

تاریخ انتشار 2018-12-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023