DC Field | Value | Language |
---|---|---|
dc.contributor.author | Fossorier, Marc P. C. | en |
dc.contributor.author | Mihaljević, Miodrag J. | en |
dc.contributor.author | Imai, Hideki | en |
dc.date.accessioned | 2020-03-05T20:28:23Z | - |
dc.date.available | 2020-03-05T20:28:23Z | - |
dc.date.issued | 2005-01-01 | en |
dc.identifier.isbn | 0-7803-9151-9 | en |
dc.identifier.issn | 2157-8099 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/119 | - |
dc.description.abstract | 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. | en |
dc.publisher | IEEE | - |
dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en |
dc.subject | Codes (symbols) | Computational complexity | Correlation methods | Decoding | - |
dc.title | A unified analysis for the fast correlation attack | en |
dc.type | Conference Paper | en |
dc.identifier.doi | 10.1109/ISIT.2005.1523698 | en |
dc.identifier.scopus | 2-s2.0-33749436577 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 2012 | en |
dc.relation.lastpage | 2015 | en |
dc.relation.volume | 2005 | en |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.openairetype | Conference Paper | - |
item.cerifentitytype | Publications | - |
crisitem.author.orcid | 0000-0003-3047-3020 | - |
SCOPUSTM
Citations
5
checked on Oct 20, 2024
Page view(s)
9
checked on Oct 20, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.