On High-Rate Cryptographic Compression Functions
نویسندگان
چکیده
The security of iterated hash functions relies on the properties of underlying compression functions. We study highly efficient compression functions based on block ciphers. We propose a model for highrate compression functions, and give an upper bound for the rate of any collision resistant compression function in our model. In addition, we show that natural generalizations of constructions by Preneel, Govaerts, and Vandewalle to the case of rate-2 compression functions are not collision resistant.
منابع مشابه
Improved Rate Upper Bound of Collision Resistant Compression Functions
Based on Stanek’s results [1] we know that in model with integer rate PGV like compression functions no high speed collision resistant compression functions exist. Thus we try to study more general multiple block ciphers based model of compression functions with rational rate, like 6/5. We show a new upper bound of the rate of collision resistant compression functions in this model. 1 Motivatio...
متن کاملOn the Randomness and Regularity of Reduced Edon-R Compression Function
EDON-R is one of the candidate hash functions for the ongoing NIST competition for the next cryptographic hash standard called SHA-3. Its construction is based on algebraic properties of non-commutative and non-associative quasigroups of orders 2 and 2. In this paper we are giving some of our results in investigation of the randomness and regularity of reduced EDON-R compression functions over ...
متن کاملHash Functions Based on Block Ciphers and Quaternary Codes
We consider constructions for cryptographic hash functions based onm-bit block ciphers. First we present a new attack on the LOKIDBH mode: the attack finds collisions in 2 encryptions, which should be compared to 2 encryptions for a brute force attack. This attack breaks the last remaining subclass in a wide class of efficient hash functions which have been proposed in the literature. We then a...
متن کاملAn FPGA implementation of SHA 3 using keccak function for 512 bit encryption
SHA-3 (Secure hash algorithm-3), originally known as Keccak is a cryptographic hash function selected as the winner of the NIST hash function competition. Hash functions have many applications in cryptography mainly in digital signatures and message authentication codes and in network security. Implementation of the main building block (compression function) for five different SHA-3 candidates ...
متن کاملEnhancing the Security Level of SHA-1 by Replacing the MD Paradigm
Cryptographic hash functions are important cryptographic techniques and are used widely in many cryptographic applications and protocols. All the MD4 design based hash functions such as MD5, SHA-0, SHA-1 and RIPEMD-160 are built on Merkle-Damgård iterative method. Recent differential and generic attacks against these popular hash functions have shown weaknesses of both specific hash functions a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers and Artificial Intelligence
دوره 26 شماره
صفحات -
تاریخ انتشار 2005