An Efficient Construction of a Compression Function for Cryptographic Hash
A 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 verif
- PDF / 733,874 Bytes
- 17 Pages / 439.37 x 666.142 pts Page_size
- 64 Downloads / 256 Views
Graduate School of Engineering, Osaka University, Osaka, Japan {miyaji,su}@comm.eng.osaka-u.ac.jp 2 Japan Advanced Institute of Science and Technology, Nomi, Japan {s1420213,miyaji}@jaist.ac.jp 3 Japan Science and Technology Agency (JST) CREST, Tokyo, Japan
Abstract. A cryptographic hash (CH) 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 CH is an efficient primitive of security solution for IoT-end devices, constrained devices, and RfID. The construction of the 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 (n, 2n) 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 (r) of the proposed scheme is r ≈ 1. Furthermore, the collision security is bounded by q = 2125.84 (q = numer of query). 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. Keywords: Cryptographic hash device
1
·
Collision resistance
·
Constrained
Introduction
A cryptographic hash (CH) is defined as to proceed data from an arbitrary domain to a fixed domain [1,2,6–8,10]. The applications of CH are enormous. This work is partially supported by the Grant-in-Aid for Scientific Research (C)(15K00183) and (15K00189) and Japan Science and Technology Agency, CREST and Infrastructure Development for Promoting International S&T Cooperation. C. Su—JSPS Grant-in-Aid for Young Scientists (15K16005). c IFIP International Federation for Information Processing 2016 Published by Springer International Publishing Switzerland 2016. All Rights Reserved F. Buccafurri et al. (Eds.): CD-ARES 2016, LNCS 9817, pp. 124–140, 2016. DOI: 10.1007/978-3-319-45507-5 9
An Efficient Construction of a Compression Function for CH
125
Fig. 1. Basic concept of cryptographic hash [2, 6, 8, 34]
Generally, the CH is used in message verification, password verification, pseudorandom generation, and message authentication [1–3,7]. Furthermore, the cryptographic hash is an efficient primitive of security solution for IoT-end device, RfID, and resource constrained device [35–39,44]. 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 b
Data Loading...
