Analysis of Trivium by a Simulated Annealing variant

Julia Borghoff, Lars Ramkilde Knudsen, Krystian Matusiewicz

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    210 Downloads (Pure)

    Abstract

    This paper proposes a new method of solving 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 wellsuited for this type of system and provide some experimental results.
    Original languageEnglish
    Title of host publicationProceedings of the ECRYPT workshop on tools in cryptanalysis 2010
    EditorsFrancois-Xaver Standaert
    Publication statusE-pub ahead of print - 2010
    EventECRYPT workshop on Tools for Cryptanalysis 2010 - Royal Holloway, University of London, Egham, UK
    Duration: 1 Jan 2010 → …

    Conference

    ConferenceECRYPT workshop on Tools for Cryptanalysis 2010
    CityRoyal Holloway, University of London, Egham, UK
    Period01/01/2010 → …

    Fingerprint Dive into the research topics of 'Analysis of Trivium by a Simulated Annealing variant'. Together they form a unique fingerprint.

    Cite this