JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: https://hdl.handle.net/10119/12981

Title: A New (n, n) Blockcipher Hash Function Using Feistel Network: Apposite for RFID Security
Authors: Miyaji, Atsuko
Rashed, Mazumder
Keywords: blockcipher
AES
deal cipher model
collision security
preimage security
Issue Date: 2014-12-12
Publisher: Springer
Magazine name: Smart Innovation, Systems and Technologies
Volume: 33
Start page: 519
End page: 528
DOI: 10.1007/978-81-322-2202-6_47
Abstract: In this paper, we proposed a new (n, n) double block length hash function using Feistel network which is suitable for providing security to the WSN (wireless sensor network) device or RFID tags. We use three calls of AES-128 (E_1, E_2, E_3) in a single blockcipher E′ so that the efficiency rate is 0.33. Surprisingly we found that the security bound of this scheme is better than other famous (n, n) based blockcipher schemes such as MDC-2, MDC-4, MJH. The collision resistance (CR) and preimage resistance (PR) security bound are respectively by O(2^n) and O(2^<2n>). We define our new scheme as JAIST according to our institute name.
Rights: This is the author-created version of Springer, Atsuko Miyaji, Mazumder Rashed, Smart Innovation, Systems and Technologies, 33, 2014, pp.519-528. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-81-322-2202-6_47
URI: https://hdl.handle.net/10119/12981
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
21099.pdf266KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, JAIST (ir-sys[at]ml.jaist.ac.jp)