The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La sécurité des fonctions de hachage basées sur la permutation dans le modèle de permutation idéal a été étudiée lorsque la longueur d'entrée de la fonction de compression est supérieure à la longueur d'entrée de la fonction de permutation. Dans cet article, nous considérons les fonctions de compression basées sur la permutation qui ont des longueurs d'entrée plus courtes que celle de la permutation. Sous cette hypothèse, nous proposons une fonction de compression basée sur la permutation et prouvons sa sécurité par rapport aux collisions et aux (secondes) attaques de pré-image dans le modèle de permutation idéal. La fonction de compression proposée peut être considérée comme une généralisation de la fonction de compression de la fonction de hachage MD6.
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.
Copier
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
Copier
@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},}
Copier
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 -