Next Article in Journal
Designing Secure Heterogeneous Multicore Systems from Untrusted Components
Previous Article in Journal
ReSOLV: Applying Cryptocurrency Blockchain Methods to Enable Global Cross-Platform Software License Validation
Article Menu

Export Article

Open AccessArticle
Cryptography 2018, 2(2), 11; https://doi.org/10.3390/cryptography2020011

Sequential Hashing with Minimum Padding

Faculty of Engineering, University of Fukui, Fukui 910-8507, Japan
Received: 10 May 2018 / Revised: 5 June 2018 / Accepted: 7 June 2018 / Published: 10 June 2018
Full-Text   |   PDF [1901 KB, uploaded 10 June 2018]   |  

Abstract

This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property. The collision resistance of a hash function using the proposed domain extension is shown to be reduced to the collision resistance and the everywhere preimage resistance of the underlying compression function in the standard model, where the compression function is assumed to be chosen at random from a function family in some efficient way. Its indifferentiability from a random oracle up to the birthday bound is also shown on the assumption that the underlying compression function is a fixed-input-length random oracle or the Davies-Meyer mode of a block cipher chosen uniformly at random. The proposed domain extension is also applied to the sponge construction and the resultant hash function is shown to be indifferentiable from a random oracle up to the birthday bound in the ideal permutation model. The proposed domain extension scheme is expected to be useful for processing short messages. View Full-Text
Keywords: hash function; domain extension; collision resistance; indifferentiability hash function; domain extension; collision resistance; indifferentiability
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Hirose, S. Sequential Hashing with Minimum Padding. Cryptography 2018, 2, 11.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top