A New Scheme of Blockcipher Hash

Rashed MAZUMDER; Atsuko MIYAJI

doi:10.1587/transinf.2015ICP0028

A New Scheme of Blockcipher Hash

Rashed MAZUMDER, Atsuko MIYAJI

Full Text Views

0

Share
Cite this

Summary :

A 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.

Publication: IEICE TRANSACTIONS on Information Vol.E99-D No.4 pp.796-804

Publication Date: 2016/04/01

Publicized: 2016/01/13

Online ISSN: 1745-1361

DOI: 10.1587/transinf.2015ICP0028

Type of Manuscript: Special Section PAPER (Special Section on Information and Communication System Security)

Category: Cryptography and cryptographic protocols

Authors

Rashed MAZUMDER
JAIST
Atsuko MIYAJI
JAIST,Osaka University,Japan Science and Technology Agency (JST) CREST

Keyword

cryptographic hash, blockcipher, ideal cipher model, weak cipher model, collision and preimage resistance

Cite this

Copy

Rashed MAZUMDER, Atsuko MIYAJI, "A New Scheme of Blockcipher Hash" in IEICE TRANSACTIONS on Information, vol. E99-D, no. 4, pp. 796-804, April 2016, doi: 10.1587/transinf.2015ICP0028.
Abstract: A 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.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.2015ICP0028/_p

Copy

@ARTICLE{e99-d_4_796,
author={Rashed MAZUMDER, Atsuko MIYAJI, },
journal={IEICE TRANSACTIONS on Information},
title={A New Scheme of Blockcipher Hash},
year={2016},
volume={E99-D},
number={4},
pages={796-804},
abstract={A 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.},
keywords={},
doi={10.1587/transinf.2015ICP0028},
ISSN={1745-1361},
month={April},}

Copy

TY - JOUR
TI - A New Scheme of Blockcipher Hash
T2 - IEICE TRANSACTIONS on Information
SP - 796
EP - 804
AU - Rashed MAZUMDER
AU - Atsuko MIYAJI
PY - 2016
DO - 10.1587/transinf.2015ICP0028
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2016
AB - A 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.
ER -