A New (n, 2n) Double Block Length Hash Function Based on Single Key Scheduling

Lecture Notes in Computer Science

2016

Self Cite

Part 1: The International Cross Domain Conference (CD-ARES 2016)International audienceA cryptographic hash $$\left( \text {CH}\right) $$ is an algorithm that invokes an arbitrary domain of the message and returns fixed size of an output. The numbers of application of cryptographic hash are enormous such as message integrity, password verification, and pseudorandom generation. Furthermore, the $$\mathrm {CH}$$ is an efficient primitive of security solution for IoT-end devices, constrained devices, and RfID. The construction of the $$\mathrm {CH}$$ depends on a compression function, where the compression function is constructed through a scratch or blockcipher. Generally, the blockcipher based cryptographic hash is more applicable than the scratch based hash because of direct implementation of blockcipher rather than encryption function. Though there are many $$\left( n, 2n\right) $$ blockcipher based compression functions, but most of the prominent schemes such as MR, Weimar, Hirose, Tandem, Abreast, Nandi, and ISA09 are focused for rigorous security bound rather than efficiency. Therefore, a more efficient construction of blockcipher based compression function is proposed, where it provides higher efficiency-rate including a satisfactory collision security bound. The efficiency-rate $$\left( r\right) $$ of the proposed scheme is $$r \approx 1$$. Furthermore, the collision security is bounded by $$q=2^{125.84}$$ $$\left( q=\text {numer of query}\right) $$. Moreover, the proposed construction requires two calls of blockcipher under single iteration of encryption. Additionally, it has double key scheduling and it’s operational mode is parallel

Section: Namementioning

confidence: 93%

“…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].…”

Section: Namementioning

confidence: 99%

See 1 more Smart Citation

An Efficient Construction of a Compression Function for Cryptographic Hash

Lecture Notes in Computer Science

2016

Self Cite

“…However, Liscov point out the issue of the weak ideal compression function independently at first in 2006 [19], where the adversary is allowed to make total three types of query such as E f , E b and E k (key-disclosure query). Therefore, the adversary of WCM is stronger than that of the ICM (details in [17], [19], [20] [31] 3n…”

Section: Introductionmentioning

confidence: 99%

“…On the contrary, the Weimar-DM needs multiple key scheduling (Table 1). Usually, the number of gates will be increased if any scheme needs multiple key scheduling (details in [10], [31]). The efficiency rate of the Nandi and ISA-09 are 2/3 but the collision security bound are less than that of the Weimar and Hirose-DM [3], [4].…”

Section: Introductionmentioning

confidence: 99%

A New Scheme of Blockcipher Hash

IEICE Trans. Inf. & Syst.

2016

Self Cite

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

Variable message encryption through blockcipher compression function

Chen

Concurrency and Computation

et al. 2016

Self Cite

Summary A constrained device is an emerging technology that has enormous applications in our daily life such as access control, inventory control, luggage tracking, bar‐code reader, and IoT. However, it has certain drawbacks of low memory and less computing power. Thus, one of the cracking challenges is to provide efficient and secure cryptographic solution for the constrained device in the aspect of security issue. An (n,n) blockcipher‐based cryptographic compression function is applicable to provide provable security to the constrained device. Though, there are many constructions of (n,n) blockcipher such as MDC‐2, MDC‐4, MJH, Bart‐12, and SKS‐15. However, most of the familiar schemes are not suitable for short and variable message encryption without padding because of their internal structures. Furthermore, the security margin is provided based on blocklength rather than the flexible size of message. In this paper, we present two different (n,n) blockcipher compression function schemes. The first scheme (FS) satisfies better efficiency such as less call of blockcipher, less key scheduling, and higher efficiency rate. On the contrary, the second scheme (SS) has upper security bound. Moreover, both of the schemes are suitable for small and variable message encryption (message size = tn|t < 1,n:blocklength), which is handy for the constrained device. The collision and preimage security bound of the FS are O(2tn/2) and O(2tn). In addition, the SS's collision resistance and preimage resistance are bounded by O(2tn) and O(22tn). Moreover, the efficiency rate of the proposed two schemes are respectively t and t/3. The numbers of key scheduling are 2 for the constructions of FS and SS. We use two calls of blockcipher in the FS. On the contrary, three calls of blockcipher are used in the SS. Copyright © 2016 John Wiley & Sons, Ltd.