How to use metaheuristics for design of symmetric-key primitives

DOI10.1007/978-3-319-70700-6_13zbMath1417.94078OpenAlexW2769858179MaRDI QIDQ1701452

Ivica Nikolić

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70700-6_13

zbMATH Keywords

simulated annealinggenetic algorithmmetaheuristiccryptographic primitiveautomatic tool

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Cryptography (94A60)

Related Items (4)

Variants of the AES key schedule for better truncated differential bounds ⋮ Block cipher invariants as eigenvectors of correlation matrices ⋮ The \texttt{Deoxys} AEAD family ⋮ Lightweight authenticated encryption mode suitable for threshold implementation

This page was built for publication: How to use metaheuristics for design of symmetric-key primitives