DC FieldValueLanguage
dc.contributor.authorMihaljević, Miodrag J.en
dc.contributor.authorFossorier, Marc P. C.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.isbn978-3-540-44706-1en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/139-
dc.description.abstractAn algorithm for cryptanalysis of certain keystream gene- rators is proposed. The developed algorithm has the following two ad- vantages over other reported ones: (i) it is more powerful and (ii) it provides a high-speed software implementation, as well as a simple hard- ware one, suitable for high parallel architectures. The novel algorithm is a method for the fast correlation attack with significantly better performance than other reported methods, assuming a lower complexity and the same inputs. The algorithm is based on decoding procedures of the corresponding binary block code with novel constructions of the parity- checks, and the following two decoding approaches are employed: the a posterior probability based threshold decoding and the belief propagation based bit-flipping iterative decoding. These decoding procedures offer good trade-offs between the required sample length, overall complexity and performance. The novel 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.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.subjectDecoding | Fast correlation attack | Keystream generators | Linear feedback shift registers | Stream ciphersen
dc.titleA Low-Complexity and High-Performance algorithm for the fast correlation attacken
dc.typeArticleen
dc.identifier.doi10.1007/3-540-44706-7_14-
dc.identifier.scopus2-s2.0-84974727960en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage196en
dc.relation.lastpage212en
dc.relation.volume1978en
dc.description.rankM21-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0003-3047-3020-
Show simple item record

SCOPUSTM   
Citations

38
checked on Jan 29, 2023

Page view(s)

48
checked on Jan 30, 2023

Google ScholarTM

Check

Altmetric

Altmetric


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