ElimLin algorithm revisited

DOI10.1007/978-3-642-34047-5_18MaRDI QIDQ4899712zbMATH OpenOpenAlexFDO

Authors Nicolas Courtois, Pouyan Sepehrdad, Petr Sušil, Serge Vaudenay

Publication date 8 January 2013

Published in Fast Software Encryption (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34047-5_18

zbMATH Keywords

algebraic cryptanalysisblock cipherssystems of sparse polynomial equations of low degree

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• An Analysis of the XSL Algorithm
• All in the XL Family: Theory and Practice
• scientific article; zbMATH DE number 1962148
• Algebraic Cryptanalysis

Cited in

(5)

• On conversions from CNF to ANF
• Further analysis of the remedian algorithm
• FUTURE: a lightweight block cipher using an optimal diffusion matrix
• An enhanced binary characteristic set algorithm and its applications to algebraic cryptanalysis
• SAT solving using XOR-OR-AND normal forms.

This page was built for publication: ElimLin algorithm revisited

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