DC FieldValueLanguage
dc.contributor.authorMihaljević, Miodrag J.en
dc.contributor.authorImai, Hidekien
dc.date.accessioned2020-03-05T20:28:25Z-
dc.date.available2020-03-05T20:28:25Z-
dc.date.issued2001-01-01en
dc.identifier.issn2157-8095en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/138-
dc.description.abstractAn approach for construction of algorithms for the fast correlation attack employing the multi-weight parity-checks is pointed out. The proposed approach is based on the following: (i) construct appropriate different weight parity-checks assuming that certain information bits are known; (ii) decode each of the remained information bits employing certain exhaustive search and threshold decoding technique. An analysis of the performance is given.en
dc.publisherIEEE-
dc.relation.ispartofIEEE International Symposium on Information Theory - Proceedingsen
dc.subjectAlgorithms | Bit error rate | Cryptography | Decoding | Linear equations | Matrix algebra | Polynomials | Probability density function | Vectors-
dc.titleOn employment of different weight parity-checks for the fast correlation attacken
dc.typeConference Paperen
dc.relation.conferenceIEEE International Symposium on Information Theory (ISIT 2001); Washington, DC; United States; 24 June 2001 through 29 June 2001-
dc.identifier.doi10.1109/ISIT.2001.935982-
dc.identifier.scopus2-s2.0-0034850872en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage119en
dc.description.rankM23-
item.openairetypeConference Paper-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-3047-3020-
Show simple item record

SCOPUSTM   
Citations

2
checked on Apr 22, 2024

Page view(s)

56
checked on Apr 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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