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
Troika는 IOTA의 삼항 아키텍처 및 플랫폼을 위해 최근 제안된 스폰지 기반 해시 함수로, CYBERCRYPT에서 개발하여 현재 IOTA의 블록체인에서 사용됩니다. 본 논문에서는 분할 정복 접근 방식을 사용하여 2/3 라운드 트로이카에 대한 사전 이미지 공격을 소개합니다. 첫째, 메시지가 사전이미지인지 여부를 판단하기 위한 등가 조건을 대수적 방법으로 제안한다. 결과적으로 2라운드 트로이카에 대한 사전 이미지 공격의 경우 유효하고 작은 공간에서만 사전 이미지를 검색할 수 있으며 추측 및 결정 기법을 사용하여 대부분의 등가 조건을 만족할 수 있는 메시지를 효율적으로 열거할 수 있습니다. 우리의 실험에서는 3라운드 트로이카에 대한 사전 이미지 공격의 시간 복잡도가 XNUMX으로 향상될 수 있음을 보여줍니다.79 3에서243. 3라운드 트로이카에 대한 사전 이미지 공격의 경우 최적의 시간 복잡도인 3을 얻기 위해 MILP 기반 방법을 적용합니다.27 무차별 대입보다 몇 배 더 빠릅니다.
Fukang LIU
University of Hyogo,East China Normal University
Takanori ISOBE
University of Hyogo,National Institute of Information and Communications Technology
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.
부
Fukang LIU, Takanori ISOBE, "Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 11, pp. 1260-1273, November 2020, doi: 10.1587/transfun.2019EAP1166.
Abstract: Troika is a recently proposed sponge-based hash function for IOTA's ternary architecture and platform, which is developed by CYBERCRYPT and is now used in IOTA's blockchain. In this paper, we introduce the preimage attack on 2/3 rounds of Troika with a divide-and-conquer approach. Firstly, we propose the equivalent conditions to determine whether a message is the preimage with an algebraic method. As a result, for the preimage attack on two-round Troika, we can search the preimage only in a valid smaller space and efficiently enumerate the messages which can satisfy most of the equivalent conditions with a guess-and-determine technique. Our experiments show that the time complexity of the preimage attack on 2-round Troika can be improved to 379 from 3243. For the preimage attack on 3-round Troika, the MILP-based method is applied to achieve the optimal time complexity, which is 327 times faster than brute force.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAP1166/_p
부
@ARTICLE{e103-a_11_1260,
author={Fukang LIU, Takanori ISOBE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods},
year={2020},
volume={E103-A},
number={11},
pages={1260-1273},
abstract={Troika is a recently proposed sponge-based hash function for IOTA's ternary architecture and platform, which is developed by CYBERCRYPT and is now used in IOTA's blockchain. In this paper, we introduce the preimage attack on 2/3 rounds of Troika with a divide-and-conquer approach. Firstly, we propose the equivalent conditions to determine whether a message is the preimage with an algebraic method. As a result, for the preimage attack on two-round Troika, we can search the preimage only in a valid smaller space and efficiently enumerate the messages which can satisfy most of the equivalent conditions with a guess-and-determine technique. Our experiments show that the time complexity of the preimage attack on 2-round Troika can be improved to 379 from 3243. For the preimage attack on 3-round Troika, the MILP-based method is applied to achieve the optimal time complexity, which is 327 times faster than brute force.},
keywords={},
doi={10.1587/transfun.2019EAP1166},
ISSN={1745-1337},
month={November},}
부
TY - JOUR
TI - Preimage Attacks on Reduced Troika with Divide-and-Conquer Methods
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1260
EP - 1273
AU - Fukang LIU
AU - Takanori ISOBE
PY - 2020
DO - 10.1587/transfun.2019EAP1166
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2020
AB - Troika is a recently proposed sponge-based hash function for IOTA's ternary architecture and platform, which is developed by CYBERCRYPT and is now used in IOTA's blockchain. In this paper, we introduce the preimage attack on 2/3 rounds of Troika with a divide-and-conquer approach. Firstly, we propose the equivalent conditions to determine whether a message is the preimage with an algebraic method. As a result, for the preimage attack on two-round Troika, we can search the preimage only in a valid smaller space and efficiently enumerate the messages which can satisfy most of the equivalent conditions with a guess-and-determine technique. Our experiments show that the time complexity of the preimage attack on 2-round Troika can be improved to 379 from 3243. For the preimage attack on 3-round Troika, the MILP-based method is applied to achieve the optimal time complexity, which is 327 times faster than brute force.
ER -