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
SHACAL-2는 64비트 블록 크기와 최대 256비트의 가변 길이 키를 갖춘 512라운드 블록 암호입니다. NESSIE가 선택한 블록 암호 알고리즘입니다. 이 논문에서 우리는 후보 35중주가 (관련 키) 직사각형 공격에 유용한지 여부를 확인할 때 동시에 확인하는 대신 2중주에서 두 쌍을 차례로 확인할 수 있음을 관찰합니다. 첫 번째 쌍이 예상 조건을 충족하지 않으면 XNUMX중주를 즉시 삭제할 수 있습니다. 다음으로 확률 XNUMX의 XNUMX라운드 관련 키 직사각형 구분자를 활용합니다.-460 기존 35라운드 관련 키 차동 장치와 새로운 2라운드 차동 장치를 기반으로 구축된 SHACAL-24의 처음 10라운드용입니다. 마지막으로 위의 관찰을 활용하여 구분자를 사용하여 SHACAL-44의 처음 2라운드에 관련 키 직사각형 공격을 실행합니다. 공격에는 2가 필요합니다.233 관련 키가 선택된 일반 텍스트이며 시간 복잡도는 2입니다.497.2 계산. 이는 공격 라운드 수 측면에서 SHACAL-2에 대해 이전에 게시된 암호 분석 결과보다 낫습니다.
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.
부
Jiqiang LU, Jongsung KIM, "Attacking 44 Rounds of the SHACAL-2 Block Cipher Using Related-Key Rectangle Cryptanalysis" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 9, pp. 2588-2596, September 2008, doi: 10.1093/ietfec/e91-a.9.2588.
Abstract: SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. It is a NESSIE selected block cipher algorithm. In this paper, we observe that, when checking whether a candidate quartet is useful in a (related-key) rectangle attack, we can check the two pairs from the quartet one after the other, instead of checking them simultaneously; if the first pair does not meet the expected conditions, we can discard the quartet immediately. We next exploit a 35-round related-key rectangle distinguisher with probability 2-460 for the first 35 rounds of SHACAL-2, which is built on an existing 24-round related-key differential and a new 10-round differential. Finally, taking advantage of the above observation, we use the distinguisher to mount a related-key rectangle attack on the first 44 rounds of SHACAL-2 . The attack requires 2233 related-key chosen plaintexts, and has a time complexity of 2497.2 computations. This is better than any previously published cryptanalytic results on SHACAL-2 in terms of the numbers of attacked rounds.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.9.2588/_p
부
@ARTICLE{e91-a_9_2588,
author={Jiqiang LU, Jongsung KIM, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Attacking 44 Rounds of the SHACAL-2 Block Cipher Using Related-Key Rectangle Cryptanalysis},
year={2008},
volume={E91-A},
number={9},
pages={2588-2596},
abstract={SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. It is a NESSIE selected block cipher algorithm. In this paper, we observe that, when checking whether a candidate quartet is useful in a (related-key) rectangle attack, we can check the two pairs from the quartet one after the other, instead of checking them simultaneously; if the first pair does not meet the expected conditions, we can discard the quartet immediately. We next exploit a 35-round related-key rectangle distinguisher with probability 2-460 for the first 35 rounds of SHACAL-2, which is built on an existing 24-round related-key differential and a new 10-round differential. Finally, taking advantage of the above observation, we use the distinguisher to mount a related-key rectangle attack on the first 44 rounds of SHACAL-2 . The attack requires 2233 related-key chosen plaintexts, and has a time complexity of 2497.2 computations. This is better than any previously published cryptanalytic results on SHACAL-2 in terms of the numbers of attacked rounds.},
keywords={},
doi={10.1093/ietfec/e91-a.9.2588},
ISSN={1745-1337},
month={September},}
부
TY - JOUR
TI - Attacking 44 Rounds of the SHACAL-2 Block Cipher Using Related-Key Rectangle Cryptanalysis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2588
EP - 2596
AU - Jiqiang LU
AU - Jongsung KIM
PY - 2008
DO - 10.1093/ietfec/e91-a.9.2588
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2008
AB - SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. It is a NESSIE selected block cipher algorithm. In this paper, we observe that, when checking whether a candidate quartet is useful in a (related-key) rectangle attack, we can check the two pairs from the quartet one after the other, instead of checking them simultaneously; if the first pair does not meet the expected conditions, we can discard the quartet immediately. We next exploit a 35-round related-key rectangle distinguisher with probability 2-460 for the first 35 rounds of SHACAL-2, which is built on an existing 24-round related-key differential and a new 10-round differential. Finally, taking advantage of the above observation, we use the distinguisher to mount a related-key rectangle attack on the first 44 rounds of SHACAL-2 . The attack requires 2233 related-key chosen plaintexts, and has a time complexity of 2497.2 computations. This is better than any previously published cryptanalytic results on SHACAL-2 in terms of the numbers of attacked rounds.
ER -