## Hill climbing algorithms and trivium

Publication: Research - peer-review › Article in proceedings – Annual report year: 2011

### Standard

**Hill climbing algorithms and trivium.** / Borghoff, Julia; Knudsen, Lars Ramkilde; Matusiewicz, Krystian.

Publication: Research - peer-review › Article in proceedings – Annual report year: 2011

### Harvard

*Lecture Notes in Computer Science.*vol. 6544, Springer, pp. 57-73. Lecture Notes in Computer Science, , 10.1007/978-3-642-19574-7_4

### APA

*Lecture Notes in Computer Science.*(Vol. 6544, pp. 57-73). Springer. (Lecture Notes in Computer Science). 10.1007/978-3-642-19574-7_4

### CBE

### MLA

*Lecture Notes in Computer Science.*Springer. 2011. 57-73. (Lecture Notes in Computer Science). Available: 10.1007/978-3-642-19574-7_4

### Vancouver

### Author

### Bibtex

}

### RIS

TY - GEN

T1 - Hill climbing algorithms and trivium

AU - Borghoff,Julia

AU - Knudsen,Lars Ramkilde

AU - Matusiewicz,Krystian

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Cryptanalysis

KW - Trivium

KW - Simulated annealing

U2 - 10.1007/978-3-642-19574-7_4

DO - 10.1007/978-3-642-19574-7_4

M3 - Article in proceedings

VL - 6544

SP - 57

EP - 73

BT - Lecture Notes in Computer Science

T2 - Lecture Notes in Computer Science

PB - Springer

ER -