A New Scheme of Blockcipher Hash

Abstract

SUMMARYA cryptographic hash is an important tool in the area of a modern cryptography. It comprises a compression function, where the compression function can be built by a scratch or blockcipher. There are some familiar schemes of blockcipher compression function such as Weimar, Hirose, Tandem, Abreast, Nandi, ISA-09. Interestingly, the security proof of all the mentioned schemes are based on the ideal cipher model (ICM), which depends on ideal environment. Therefore, it is desired to use such a proof technique model, which is close to the real world such as weak cipher model (WCM). Hence, we proposed an (n, 2n) blockcipher compression function, which is secure under the ideal cipher model, weak cipher model and extended weak cipher model (ext.WCM). Additionally, the majority of the existing schemes need multiple key schedules, where the proposed scheme and the Hirose-DM follow single key scheduling property. The efficiency-rate of our scheme is r = 1/2. Moreover, the number of blockcipher call of this scheme is 2 and it runs in parallel. key words: cryptographic hash, blockcipher, ideal cipher model, weak cipher model, collision and preimage resistance

An Efficient Construction of a Compression Function for Cryptographic Hash

“…CR KS r # E OM MR [23,31] Motivation. The parameters of CR, P R, r, #E, OM , and KS are vital for any satisfactory scheme of blockcipher based compression function [1, 6-8, 13, 21].…”

“…Usually, the internal construction of CH depends on compression function [16,17]. The compression function is based on scratch or blockcipher [6,8,16,17,31]. The blockcipher based compression function is a combination of component functions (Fig.…”