EPC: A Provably Secure Permutation Based Compression Function
Summary :
The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths shorter than that of the permutation. Under this assumption, we propose a permutation based compression function and prove its security with respect to collision and (second) preimage attacks in the ideal permutation model. The proposed compression function can be seen as a generalization of the compression function of MD6 hash function.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.10 pp.1833-1836
- Publication Date
- 2010/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1833
- Type of Manuscript
- LETTER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Nasour BAGHERI, Praveen GAURAVARAM, Majid NADERI, Babak SADEGHIYAN, "EPC: A Provably Secure Permutation Based Compression Function" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 10, pp. 1833-1836, October 2010, doi: 10.1587/transfun.E93.A.1833.
Abstract: The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths shorter than that of the permutation. Under this assumption, we propose a permutation based compression function and prove its security with respect to collision and (second) preimage attacks in the ideal permutation model. The proposed compression function can be seen as a generalization of the compression function of MD6 hash function.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1833/_p
Copy
@ARTICLE{e93-a_10_1833,
author={Nasour BAGHERI, Praveen GAURAVARAM, Majid NADERI, Babak SADEGHIYAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={EPC: A Provably Secure Permutation Based Compression Function},
year={2010},
volume={E93-A},
number={10},
pages={1833-1836},
abstract={The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths shorter than that of the permutation. Under this assumption, we propose a permutation based compression function and prove its security with respect to collision and (second) preimage attacks in the ideal permutation model. The proposed compression function can be seen as a generalization of the compression function of MD6 hash function.},
keywords={},
doi={10.1587/transfun.E93.A.1833},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - EPC: A Provably Secure Permutation Based Compression Function
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1833
EP - 1836
AU - Nasour BAGHERI
AU - Praveen GAURAVARAM
AU - Majid NADERI
AU - Babak SADEGHIYAN
PY - 2010
DO - 10.1587/transfun.E93.A.1833
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2010
AB - The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths shorter than that of the permutation. Under this assumption, we propose a permutation based compression function and prove its security with respect to collision and (second) preimage attacks in the ideal permutation model. The proposed compression function can be seen as a generalization of the compression function of MD6 hash function.
ER -
English
