Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
From MaRDI portal
Publication:2999550
DOI10.1515/JMC.2011.001zbMath1211.94040WikidataQ121011367 ScholiaQ121011367MaRDI QIDQ2999550
Publication date: 13 May 2011
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
90C90: Applications of mathematical programming
90C56: Derivative-free methods and methods using generalized derivatives
94A60: Cryptography
90C09: Boolean programming
Cites Work
- Pseudo-Boolean optimization
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Fast algorithm for the cutting angle method of global optimization
- The basic algorithm for pseudo-Boolean programming revisited
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
- Algebraic Techniques in Differential Cryptanalysis
- Numerical solvers and cryptanalysis
- Collisions and Other Non-random Properties for Step-Reduced SHA-256
- Bivium as a Mixed-Integer Linear Programming Problem
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Partial subdifferentials, derivates and Rademacher’s Theorem
- Survey of Bundle Methods for Nonsmooth Optimization
- A Method for Minimization of Quasidifferentiable Functions
- Implementation of novel methods of global and nonsmooth optimization: GANSO programming library