In this paper, important methods for cryptanalysis of the stream cipher based on a class of keystream generators are discussed. These methods employ an approach called the fast correlation attack. This cryptographic problem is treated by considering its equivalent channel coding approach, namely decoding of certain very low rate codes in presence of very high noise. A novel family of algorithms for the fast correlation attack is presented. The algorithms are based on the iterative decoding principle in conjunction with a novel method for constructing the parity-checks. A goal of this paper is to summarize reported results and to compare some of the recent ones. Accordingly, the family is compared with recently proposed improved fast correlation attacks based on iterative decoding methods. An analysis of the algorithms performances and complexities is presented. The corresponding trade-offs between performance, complexity and required inputs are pointed out.
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.
Copy
Miodrag J. MIHALJEVIC, Marc P. C. FOSSORIER, Hideki IMAI, "On Decoding Techniques for Cryptanalysis of Certain Encryption Algorithms" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 4, pp. 919-930, April 2001, doi: .
Abstract: In this paper, important methods for cryptanalysis of the stream cipher based on a class of keystream generators are discussed. These methods employ an approach called the fast correlation attack. This cryptographic problem is treated by considering its equivalent channel coding approach, namely decoding of certain very low rate codes in presence of very high noise. A novel family of algorithms for the fast correlation attack is presented. The algorithms are based on the iterative decoding principle in conjunction with a novel method for constructing the parity-checks. A goal of this paper is to summarize reported results and to compare some of the recent ones. Accordingly, the family is compared with recently proposed improved fast correlation attacks based on iterative decoding methods. An analysis of the algorithms performances and complexities is presented. The corresponding trade-offs between performance, complexity and required inputs are pointed out.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_4_919/_p
Copy
@ARTICLE{e84-a_4_919,
author={Miodrag J. MIHALJEVIC, Marc P. C. FOSSORIER, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Decoding Techniques for Cryptanalysis of Certain Encryption Algorithms},
year={2001},
volume={E84-A},
number={4},
pages={919-930},
abstract={In this paper, important methods for cryptanalysis of the stream cipher based on a class of keystream generators are discussed. These methods employ an approach called the fast correlation attack. This cryptographic problem is treated by considering its equivalent channel coding approach, namely decoding of certain very low rate codes in presence of very high noise. A novel family of algorithms for the fast correlation attack is presented. The algorithms are based on the iterative decoding principle in conjunction with a novel method for constructing the parity-checks. A goal of this paper is to summarize reported results and to compare some of the recent ones. Accordingly, the family is compared with recently proposed improved fast correlation attacks based on iterative decoding methods. An analysis of the algorithms performances and complexities is presented. The corresponding trade-offs between performance, complexity and required inputs are pointed out.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - On Decoding Techniques for Cryptanalysis of Certain Encryption Algorithms
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 919
EP - 930
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 - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2001
AB - In this paper, important methods for cryptanalysis of the stream cipher based on a class of keystream generators are discussed. These methods employ an approach called the fast correlation attack. This cryptographic problem is treated by considering its equivalent channel coding approach, namely decoding of certain very low rate codes in presence of very high noise. A novel family of algorithms for the fast correlation attack is presented. The algorithms are based on the iterative decoding principle in conjunction with a novel method for constructing the parity-checks. A goal of this paper is to summarize reported results and to compare some of the recent ones. Accordingly, the family is compared with recently proposed improved fast correlation attacks based on iterative decoding methods. An analysis of the algorithms performances and complexities is presented. The corresponding trade-offs between performance, complexity and required inputs are pointed out.
ER -