A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function

2014 ◽  
pp. 71-86 ◽  
Author(s):  
Shoichi Hirose ◽  
Hidenori Kuwakado
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Compression Function

scholarly journals A New Design of Cryptographic Hash Function: Gear

2016 ◽  
Vol 1 (1) ◽  
Author(s):  
Abdulaziz M Alkandari ◽  
Khalil Ibrahim Alkandari ◽  
Imad Fakhri Alshaikhli ◽  
Mohammad A. AlAhmad
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Hash Functions ◽  
Fixed Size ◽  
Compression Function ◽  
Cryptographic Hash Function ◽  
Mode Of Operation ◽  
Main Components ◽  
Map Data ◽  
And Diffusion

A hash function is any function that can be used to map data of arbitrary sizeto data of fixed size. A hash function usually has two main components: a permutationfunction or compression function and mode of operation. We will propose a new concretenovel design of a permutation based hash functions called Gear in this paper. It is a hashfunction based on block cipher in Davies-Meyer mode. It uses the patched version ofMerkle-Damgård, i.e. the wide pipe construction as its mode of operation. Thus, theintermediate chaining value has at least twice larger length than the output hash. Andthe permutations functions used in Gear are inspired from the SHA-3 finalist Grøestl hashfunction which is originally inspired from Rijndael design (AES). There is a very strongconfusion and diffusion in Gear as a result.

scholarly journals HeW: AHash Function based on Lightweight Block Cipher FeW

2017 ◽  
Vol 67 (6) ◽  
pp. 636 ◽  
Author(s):  
Manoj Kumar ◽  
Dhananjoy Dey ◽  
Saibal K Pal ◽  
Anupama Panigrahi
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Statistical Test ◽  
Vital Role ◽  
Light Weight ◽  
Avalanche Effect ◽  
Collision Resistance ◽  
Compression Function ◽  
Lightweight Block Cipher ◽  
Slide Attack

<p class="p1">A new hash function <em>HeW: </em>A hash function based on light weight block cipher <em>FeW </em>is proposed in this paper. The compression function of <em>HeW </em>is based on block cipher <em>FeW</em>. It is believed that key expansion algorithm of block cipher slows down the performance of the overlying hash function. Thereby, block ciphers become a less favourable choice to design a compression function. As a countermeasure, we cut down the key size of <em>FeW </em>from 80-bit to 64-bit and provide a secure and efficient key expansion algorithm for the modified key size. <em>FeW </em>based compression function plays a vital role to enhance the efficiency of <em>HeW</em>. We test the hash output for randomness using the NIST statistical test suite and test the avalanche effect, bit variance and near collision resistance. We also give the security estimates of <em>HeW </em>against differential cryptanalysis, length extension attack, slide attack and rotational distinguisher.<span class="Apple-converted-space"> </span></p>

Design, Analysis and Implementation of a New Hash Function Based on Block Cipher

Safe Comp 97 ◽  
1997 ◽  
pp. 148-157
Author(s):  
Xun Yi ◽  
Kwork-Yan Lam ◽  
Yong-Fei Han
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Design Analysis

scholarly journals Building a 256-bit hash function on a stronger MD variant

2014 ◽  
Vol 4 (2) ◽  
Author(s):  
Harshvardhan Tiwari ◽  
Krishna Asawa
Keyword(s):  
Hash Function ◽  
Design Principle ◽  
Hash Functions ◽  
High Sensitivity ◽  
Differential Attack ◽  
Compression Function ◽  
Single Output ◽  
Generic Attacks ◽  
Cryptographic Techniques ◽  
Cryptographic Hash Functions

AbstractCryptographic 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-1, RIPEMD-160 and FORK-256 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 and their underlying Merkle-Damgård construction. In this paper we propose a hash function follows design principle of NewFORK-256 and based on HAIFA construction. Its compression function takes three inputs and generates a single output of 256-bit length. An extra input to a compression function is a 64-bit counter (number of bits hashed so far). HAIFA construction shows strong resistance against major generic and other cryptanalytic attacks. The security of proposed hash function against generic attacks, differential attack, birthday attack and statistical attack was analyzed in detail. It is shown that the proposed hash function has high sensitivity to an input message and is secure against different cryptanalytic attacks.

scholarly journals Direct Construction of Optimal Rotational-XOR Diffusion Primitives

2017 ◽  
pp. 169-187 ◽  
Author(s):  
Zhiyuan Guo ◽  
Renzhang Liu ◽  
Si Gao ◽  
Wenling Wu ◽  
Dongdai Lin
Keyword(s):  
Diffusion Layer ◽  
Hash Function ◽  
Block Cipher ◽  
Exhaustive Search ◽  
Maximum Distance ◽  
Mds Codes ◽  
Cyclic Structure ◽  
Core Component ◽  
Direct Construction ◽  
Maximum Distance Separable

As a core component of SPN block cipher and hash function, diffusion layer is mainly introduced by matrices built from maximum distance separable (MDS) codes. Up to now, most MDS constructions require to perform an equivalent or even exhaustive search. In this paper, we study the cyclic structure of rotational-XOR diffusion layer, a commonly used diffusion primitive over (

Security and Authentication Architecture of block cipher using Mathematical operation and one-way hash function

2017 ◽  
Vol 49 (4) ◽  
pp. 226-231
Author(s):  
CH.Su neetha ◽  
◽  
D.Sravana Kumar ◽  
P.Siri sha ◽  
KM.San deep
Keyword(s):  
Hash Function ◽  
Block Cipher ◽  
Mathematical Operation

scholarly journals Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF

2018 ◽  
pp. 36-92 ◽  
Author(s):  
Nilanjan Datta ◽  
Avijit Dutta ◽  
Mridul Nandi ◽  
Goutam Paul
Keyword(s):  
Hash Function ◽  
Random Function ◽  
Design Principle ◽  
Block Cipher ◽  
Security Requirements ◽  
Design Paradigm ◽  
Beyond Birthday Bound ◽  
Generic Design

SUM-ECBC (Yasuda, CT-RSA 2010) is the first beyond birthday bound (BBB) secure block cipher based deterministic MAC. After this work, some more BBB secure deterministic MACs have been proposed, namely PMAC_Plus (Yasuda, CRYPTO 2011), 3kf9 (Zhang et al., ASIACRYPT 2012) and LightMAC_Plus (Naito, ASIACRYPT 2017). In this paper, we have abstracted out the inherent design principle of all these BBB secure MACs and present a generic design paradigm to construct a BBB secure pseudo random function, namely Double-block Hash-then- Sum or in short (DbHtS). A DbHtS construction, as the name implies, computes a double block hash on the message and then sum the encrypted output of the two hash blocks. Our result renders that if the underlying hash function meets certain security requirements (namely cover-free and block-wise universal advantage is low), DbHtS construction provides 2n/3-bit security. We demonstrate the applicability of our result by instantiating all the existing beyond birthday secure deterministic MACs (e.g., SUM-ECBC, PMAC_Plus, 3kf9, LightMAC_Plus) as well as a simple two-keyed variant for each of them and some algebraic hash based constructions.

scholarly journals Chosen-Key Distinguishers on 12-Round Feistel-SP and 11-Round Collision Attacks on Its Hashing Modes

2016 ◽  
pp. 13-32
Author(s):  
Xiaoyang Dong ◽  
Xiaoyun Wang
Keyword(s):  
Time Use ◽  
Real World ◽  
Degrees Of Freedom ◽  
Block Cipher ◽  
The Other ◽  
Compression Function ◽  
The Real ◽  
Collision Attacks ◽  
First Time ◽  
Model Affect

Since Knudsen and Rijmen proposed the known-key attacks in ASIACRYPT 2007, the open-key model becomes more and more popular. As the other component of the open-key model, chosen-key model was applied to the full attacks on AES-256 by Biryukov et al. in CRYPTO 2009. In this paper, we explore how practically the chosen-key model affect the real-world cryptography and show that 11-round generic Feistel-SP block cipher is no longer safe in its hashing modes (MMO and MP mode) as there exist collision attacks. This work improves Sasaki and Yasuda’s collision attacks by 2 rounds with two interesting techniques. First, we for the first time use the available degrees of freedom in the key to reduce the complexity of the inbound phase, which extends the previous 5-round inbound differential to a 7-round one. This results in a 12-round chosen-key distinguisher of Feistel-SP block cipher. Second, inspired by the idea of Wang et al., we construct collisions using two blocks. The rebound attack is used in the second compression function. We carefully balance the freedom of the first block and the complexity of the rebound attack, and extend the chosen-key attack to a 11-round collision attack on its hashing modes (MMO and MP mode).

Sign in / Sign up

Export Citation Format

Share Document