Authors: Fossorier, Marc P. C.
Mihaljević, Miodrag J. 
Imai, Hideki
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A unified analysis for the fast correlation attack
Journal: IEEE International Symposium on Information Theory - Proceedings
Volume: 2005
First page: 2012
Last page: 2015
Issue Date: 1-Jan-2005
ISBN: 0-7803-9151-9
ISSN: 2157-8099
DOI: 10.1109/ISIT.2005.1523698
In this paper, a general framework which enables to compare previously proposed approaches for the fast correlation attacks is developed. All attacks are based on decoding using a set of parity check sums of an underlying linear code. The purpose of this paper is two-fold: To provide a simple close form estimate about the number of check sums of a particular structure necessary for the corresponding attack to succeed. To illustrate how such estimates are useful in minimizing the computational complexity of each attack considered, and consequently, in establishing a unified framework for comparison.
Keywords: Codes (symbols) | Computational complexity | Correlation methods | Decoding
Publisher: IEEE

Show full item record


checked on Jun 24, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.