Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC

DOI10.1007/978-3-642-38519-3_12MaRDI QIDQ4922044zbMATH OpenOpenAlexFDO

Authors Michael Walter, Stanislav Bulygin, Johannes Buchmann

Publication date 28 May 2013

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38519-3_12

zbMATH Keywords

algebraic cryptanalysisguessing strategieslightweight cryptographymixed integer linear programming

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic Versus Deterministic Algebraic Cryptanalysis—A Performance Comparison
• A practical cryptanalysis of the Algebraic Eraser
• Guess-and-determine attack and algebraic attack
• Algebraic techniques in differential cryptanalysis revisited
• Algebraic cryptanalysis of variants of \textsc{Frit}
• Advanced Encryption Standard – AES
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Key guessing strategies for linear key-schedule algorithms in rectangle attacks
• Using tools from error correcting theory in linear cryptanalysis
• Some Elementary Cryptanalysis of Algebraic Cryptography

Cited in

(3)

• EPCBC -- a block cipher suitable for electronic product code encryption
• Full analysis of \textsc{PRINTcipher} with respect to invariant subspace attack: efficient key recovery and countermeasures
• scientific article; zbMATH DE number 1279023 (Why is no real title available?)

Describes a project that uses

Uses Software

• SageMath
• LBlock
• spongent
• CryptoMiniSat
• EPCBC

This page was built for publication: Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922044)