Hill Climbing Algorithms and Trivium

DOI10.1007/978-3-642-19574-7_4zbMath1290.94046OpenAlexW1564905822WikidataQ56933189 ScholiaQ56933189MaRDI QIDQ3084244

Krystian Matusiewicz, Julia Borghoff, Lars R. Knudsen

Publication date: 15 March 2011

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19574-7_4

zbMATH Keywords

simulated annealingcryptanalysisTrivium

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Cryptography (94A60)

Uses Software

• Trivium
• eSTREAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Complexity of solving algebraic equations
• Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
• A class of convergent generalized hill climbing algorithms
• Bivium as a Mixed-Integer Linear Programming Problem
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• The Data Encryption Standard (DES) and its strength against attacks
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Advances in Cryptology - CRYPTO 2003
• Two Trivial Attacks on Trivium

This page was built for publication: Hill Climbing Algorithms and Trivium