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
본 논문에서는 SHA-1 충돌 탐색 분석을 위한 외란 벡터(DV) 선택 단계에서 연쇄변수 조건(CVC)의 개수를 평가하는 새로운 알고리즘을 제안한다. 알고리즘은 이전 접근 방식에 비해 CVC 수를 보다 엄격하게 평가할 수 있는 57가지 전략을 결합하여 구성됩니다. 우리의 방법을 사용하여 59단계까지 메시지를 수정할 수 있다고 가정할 경우 첫 번째(또는 두 번째) 블록에 대해 1개(또는 2개)의 필수 CVC를 갖는 일부 DV를 찾았지만 아직 구현 가능성이 확인되지 않았습니다. 추정.
Jun YAJIMA
Terutoshi IWASAKI
Yusuke NAITO
Yu SASAKI
Takeshi SHIMOYAMA
Thomas PEYRIN
Noboru KUNIHIRO
Kazuo OHTA
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.
부
Jun YAJIMA, Terutoshi IWASAKI, Yusuke NAITO, Yu SASAKI, Takeshi SHIMOYAMA, Thomas PEYRIN, Noboru KUNIHIRO, Kazuo OHTA, "A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 1, pp. 87-95, January 2009, doi: 10.1587/transfun.E92.A.87.
Abstract: This paper proposes a new algorithm for evaluating the number of chaining variable conditions (CVCs) in the selecting step of a disturbance vector (DV) for the analysis of SHA-1 collision search. The algorithm is constructed by combining four strategies, that can evaluate the number of CVCs more strictly compared with the previous approach. By using our method, we found some DVs that have 57 (or 59) essential CVCs for 1st (or 2nd) block in the case if we assume that we can modify messages up to step 25, which we have not confirmed the practicability of the assumption.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.87/_p
부
@ARTICLE{e92-a_1_87,
author={Jun YAJIMA, Terutoshi IWASAKI, Yusuke NAITO, Yu SASAKI, Takeshi SHIMOYAMA, Thomas PEYRIN, Noboru KUNIHIRO, Kazuo OHTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search},
year={2009},
volume={E92-A},
number={1},
pages={87-95},
abstract={This paper proposes a new algorithm for evaluating the number of chaining variable conditions (CVCs) in the selecting step of a disturbance vector (DV) for the analysis of SHA-1 collision search. The algorithm is constructed by combining four strategies, that can evaluate the number of CVCs more strictly compared with the previous approach. By using our method, we found some DVs that have 57 (or 59) essential CVCs for 1st (or 2nd) block in the case if we assume that we can modify messages up to step 25, which we have not confirmed the practicability of the assumption.},
keywords={},
doi={10.1587/transfun.E92.A.87},
ISSN={1745-1337},
month={January},}
부
TY - JOUR
TI - A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 87
EP - 95
AU - Jun YAJIMA
AU - Terutoshi IWASAKI
AU - Yusuke NAITO
AU - Yu SASAKI
AU - Takeshi SHIMOYAMA
AU - Thomas PEYRIN
AU - Noboru KUNIHIRO
AU - Kazuo OHTA
PY - 2009
DO - 10.1587/transfun.E92.A.87
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2009
AB - This paper proposes a new algorithm for evaluating the number of chaining variable conditions (CVCs) in the selecting step of a disturbance vector (DV) for the analysis of SHA-1 collision search. The algorithm is constructed by combining four strategies, that can evaluate the number of CVCs more strictly compared with the previous approach. By using our method, we found some DVs that have 57 (or 59) essential CVCs for 1st (or 2nd) block in the case if we assume that we can modify messages up to step 25, which we have not confirmed the practicability of the assumption.
ER -