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
Nous fournissons une preuve formelle de l’indifférenciabilité de la fonction interne de SKINNY-HASH par rapport à un oracle aléatoire. SKINNY-HASH est une famille de fonctions de hachage basées sur une éponge qui utilisent des fonctions (au lieu de permutations) comme primitives, et elle a été sélectionnée comme l'un des candidats du deuxième tour du concours de cryptographie légère du NIST. Sa fonction interne est construite à partir du chiffrement par blocs modifiable SKINNY. La construction de la fonction interne est très simple et les concepteurs affirment n-bit de sécurité, où n est la longueur de bloc de SKINNY. Cependant, aucune preuve formelle de sécurité de cette affirmation n'est donnée dans la spécification originale de SKINNY-HASH. Dans cet article, nous prouvons formellement que la fonction interne de SKINNY-HASH a nsécurité -bit, c'est-à-dire qu'elle est indifférenciable d'un oracle aléatoire jusqu'à O(2n), confirmant les affirmations de sécurité des concepteurs.
Akinori HOSOYAMADA
NTT Corporation,Nagoya University
Tetsu IWATA
Nagoya University
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
Akinori HOSOYAMADA, Tetsu IWATA, "Indifferentiability of SKINNY-HASH Internal Functions" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 9, pp. 1156-1162, September 2021, doi: 10.1587/transfun.2020DMP0005.
Abstract: We provide a formal proof for the indifferentiability of SKINNY-HASH internal function from a random oracle. SKINNY-HASH is a family of sponge-based hash functions that use functions (instead of permutations) as primitives, and it was selected as one of the second round candidates of the NIST lightweight cryptography competition. Its internal function is constructed from the tweakable block cipher SKINNY. The construction of the internal function is very simple and the designers claim n-bit security, where n is the block length of SKINNY. However, a formal security proof of this claim is not given in the original specification of SKINNY-HASH. In this paper, we formally prove that the internal function of SKINNY-HASH has n-bit security, i.e., it is indifferentiable from a random oracle up to O(2n) queries, substantiating the security claim of the designers.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020DMP0005/_p
Copier
@ARTICLE{e104-a_9_1156,
author={Akinori HOSOYAMADA, Tetsu IWATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Indifferentiability of SKINNY-HASH Internal Functions},
year={2021},
volume={E104-A},
number={9},
pages={1156-1162},
abstract={We provide a formal proof for the indifferentiability of SKINNY-HASH internal function from a random oracle. SKINNY-HASH is a family of sponge-based hash functions that use functions (instead of permutations) as primitives, and it was selected as one of the second round candidates of the NIST lightweight cryptography competition. Its internal function is constructed from the tweakable block cipher SKINNY. The construction of the internal function is very simple and the designers claim n-bit security, where n is the block length of SKINNY. However, a formal security proof of this claim is not given in the original specification of SKINNY-HASH. In this paper, we formally prove that the internal function of SKINNY-HASH has n-bit security, i.e., it is indifferentiable from a random oracle up to O(2n) queries, substantiating the security claim of the designers.},
keywords={},
doi={10.1587/transfun.2020DMP0005},
ISSN={1745-1337},
month={September},}
Copier
TY - JOUR
TI - Indifferentiability of SKINNY-HASH Internal Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1156
EP - 1162
AU - Akinori HOSOYAMADA
AU - Tetsu IWATA
PY - 2021
DO - 10.1587/transfun.2020DMP0005
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2021
AB - We provide a formal proof for the indifferentiability of SKINNY-HASH internal function from a random oracle. SKINNY-HASH is a family of sponge-based hash functions that use functions (instead of permutations) as primitives, and it was selected as one of the second round candidates of the NIST lightweight cryptography competition. Its internal function is constructed from the tweakable block cipher SKINNY. The construction of the internal function is very simple and the designers claim n-bit security, where n is the block length of SKINNY. However, a formal security proof of this claim is not given in the original specification of SKINNY-HASH. In this paper, we formally prove that the internal function of SKINNY-HASH has n-bit security, i.e., it is indifferentiable from a random oracle up to O(2n) queries, substantiating the security claim of the designers.
ER -