Hill climbing algorithms and trivium

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

This paper proposes a new method to solve certain classes of systems of multivariate equations over the binary field and its cryptanalytical applications. We show how heuristic optimization methods such as hill climbing algorithms can be relevant to solving systems of multivariate equations. A characteristic of equation systems that may be efficiently solvable by the means of such algorithms is provided. As an example, we investigate equation systems induced by the problem of recovering the internal state of the stream cipher Trivium. We propose an improved variant of the simulated annealing method that seems to be well-suited for this type of system and provide some experimental results.
Original languageEnglish
TitleLecture Notes in Computer Science
Number of pages410
Volume6544
PublisherSpringer
Publication date2011
Pages57-73
DOIs
StatePublished

Conference

ConferenceSelected Areas in Cryptography
Number17
CountryCanada
CityWaterloo, Ontario
Period12/08/1013/08/10
NameLecture Notes in Computer Science
CitationsWeb of Science® Times Cited: No match on DOI

Keywords

  • Cryptanalysis, Trivium, Simulated annealing
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5638543