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
특정 키스트림 생성기의 암호 분석을 위한 알고리즘이 제안되었습니다. 개발된 알고리즘은 보고된 다른 알고리즘에 비해 다음과 같은 두 가지 장점이 있습니다. 즉, 더 강력하고 고속 소프트웨어 또는 높은 병렬 아키텍처에 적합한 간단한 하드웨어로 구현할 수 있습니다. 알고리즘은 패리티 검사 구성을 위한 새로운 방법을 사용하여 (해당 이진 블록 코드의) 정보 비트만의 오류 정정을 기반으로 하며, 사용된 오류 정정 절차는 APP 기반 임계값 디코딩입니다. 알고리즘 성능에 대한 실험적, 이론적 분석을 제시하고, 알고리즘의 복잡성을 평가합니다. 제안된 알고리즘은 최근에 제안된 개선된 컨볼루셔널 코드 및 터보 디코딩 기반의 빠른 상관관계 공격과 비교된다. 기본 원리, 성능 및 복잡성을 비교하고 새로운 접근 방식으로 얻은 이점을 지적합니다.
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.
부
Miodrag J. MIHALJEVIC, Marc P. C. FOSSORIER, Hideki IMAI, "An Algorithm for Cryptanalysis of Certain Keystream Generators Suitable for High-Speed Software and Hardware Implementations" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 1, pp. 311-318, January 2001, doi: .
Abstract: An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: it is more powerful, and it can be implemented by a high-speed software or a simple hardware suitable for high parallel architectures. The algorithm is based on error-correction of information bits only (of the corresponding binary block code) with a novel method for construction of the parity-checks, and the employed error-correction procedure is an APP based threshold decoding. Experimental and theoretical analyses of the algorithm performance are presented, and its complexity is evaluated. The proposed algorithm is compared with recently proposed improved fast correlation attacks based on convolutional codes and turbo decoding. The underlying principles, performance and complexity are compared, and the gain obtained with the novel approach is pointed out.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_1_311/_p
부
@ARTICLE{e84-a_1_311,
author={Miodrag J. MIHALJEVIC, Marc P. C. FOSSORIER, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Algorithm for Cryptanalysis of Certain Keystream Generators Suitable for High-Speed Software and Hardware Implementations},
year={2001},
volume={E84-A},
number={1},
pages={311-318},
abstract={An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: it is more powerful, and it can be implemented by a high-speed software or a simple hardware suitable for high parallel architectures. The algorithm is based on error-correction of information bits only (of the corresponding binary block code) with a novel method for construction of the parity-checks, and the employed error-correction procedure is an APP based threshold decoding. Experimental and theoretical analyses of the algorithm performance are presented, and its complexity is evaluated. The proposed algorithm is compared with recently proposed improved fast correlation attacks based on convolutional codes and turbo decoding. The underlying principles, performance and complexity are compared, and the gain obtained with the novel approach is pointed out.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - An Algorithm for Cryptanalysis of Certain Keystream Generators Suitable for High-Speed Software and Hardware Implementations
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 311
EP - 318
AU - Miodrag J. MIHALJEVIC
AU - Marc P. C. FOSSORIER
AU - Hideki IMAI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2001
AB - An algorithm for cryptanalysis of certain keystream generators is proposed. The developed algorithm has the following two advantages over other reported ones: it is more powerful, and it can be implemented by a high-speed software or a simple hardware suitable for high parallel architectures. The algorithm is based on error-correction of information bits only (of the corresponding binary block code) with a novel method for construction of the parity-checks, and the employed error-correction procedure is an APP based threshold decoding. Experimental and theoretical analyses of the algorithm performance are presented, and its complexity is evaluated. The proposed algorithm is compared with recently proposed improved fast correlation attacks based on convolutional codes and turbo decoding. The underlying principles, performance and complexity are compared, and the gain obtained with the novel approach is pointed out.
ER -