Bivium as a Mixed-Integer Linear Programming Problem

DOI10.1007/978-3-642-10868-6_9zbMath1234.94031OpenAlexW2102697299MaRDI QIDQ3654616

Mathias Stolpe, Julia Borghoff, Lars R. Knudsen

Publication date: 7 January 2010

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10868-6_9

Mathematics Subject Classification ID

Mixed integer programming (90C11) Cryptography (94A60)

Related Items

Enhanced-bivium algorithm for RFID system, Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures, On the efficiency of solving Boolean polynomial systems with the characteristic set method, Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY, Efficient Design Strategies Based on the AES Round Function, New results on the state cycles of Trivium, Hill Climbing Algorithms and Trivium, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Cryptanalysis of the Light-Weight Cipher A2U2