A New Double-Block-Length Hash Function Using Feistel Structure

Lee, Jesang; Hong, Seokhie; Sung, Jaechul; Park, Haeryong

doi:10.1007/978-3-642-02617-1_2

Cited by 9 publications

(14 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Usually, the ICM is used as a model for the security proof, that depends on the ideal environment [3]- [5], [11], [12], [14], [16], [23], [24], [34]. However, the ICM is far away from the real world scenario [29], [34].…”

Section: Resultsmentioning

confidence: 99%

“…In the modern cryptography, a cryptographic hash has enormous applications. It is widely used in the digital signatures, message authentication, password verification and file/data identifier [1]- [4], [21], [24]. It consists of a compression function, where the blockcipher or scratch can be used [3], [4], [14]- [16].…”

Section: Introductionmentioning

confidence: 99%

“…There are two basic classifications of the blockcipher compression function such as (n, n) and (n, 2n) blockcipher n = block, key length [1], [2], [17], [18]. However, the (n, 2n) blockcipher compression function is suitable in application level because of higher security bound [21], [23], [24].…”

Section: Introductionmentioning

confidence: 99%

“…There are some familiar schemes of (n, 2n) blockcipher compression function such as Weimar, Hirose, Abreast, Tandem, Nandi and ISA-09. However, the security proof technique of these schemes depend on the ideal cipher model [3], [4], [15], [16], [23], [24]. Usually, the security proof of any crypto-system depends on cryptographic model, where this model is defined on the basis of certain assumptions, primitives, and environments [17]- [20], [33].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A New Scheme of Blockcipher Hash

Mazumder

Miyaji

2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard 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

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Scheme of Blockcipher Hash

Mazumder

Miyaji

2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…In [13], Lee et al proposed another rate-2/3 DBL construction based on a Feistel structure. They build a (2n, 2n)-blockcipher E * with 3-round Feistel structure from a (2n, n)-blockcipher E, and then apply E * in PGV compression function, such as the DaviesMeyer structure.…”

mentioning

confidence: 99%

Attacks on a double length blockcipher-based hash proposal

2014

View full text Add to dashboard Cite

In this paper we attack a 2n-bit double length hash function proposed by Lee et al. This proposal is a blockcipher-based hash function with hash rate 2/3. The designers claimed that it could achieve ideal collision resistance and gave a security proof. However, we find a collision attack with complexity of O(2 3n/4 ) and a preimage attack with complexity of O(2 n ). Our result shows this construction is much worse than an ideal 2n-bit hash function.

show abstract

Variable message encryption through blockcipher compression function

Chen

Mazumder

Miyaji

et al. 2016

Concurrency and Computation

View full text Add to dashboard 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.

show abstract

A New Double-Block-Length Hash Function Using Feistel Structure

Cited by 9 publications

References 9 publications

A New Scheme of Blockcipher Hash

A New Scheme of Blockcipher Hash

Attacks on a double length blockcipher-based hash proposal

Variable message encryption through blockcipher compression function

Contact Info

Product

Resources

About