An application of combinatorics in cryptography

DOI10.1016/J.ENDM.2015.06.006MaRDI QIDQ322183zbMATH OpenOpenAlexFDO

Authors Zsolt Tuza, Peter Horák, Igor Semaev

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.006

zbMATH Keywords

computational complexityalgebraic cryptanalysissparse system of equations

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• A combinatorial problem related to sparse systems of equations
• Sparse algebraic equations over finite fields
• Improved agreeing-gluing algorithm
• MaxMinMax problem and sparse equations over finite fields
• On solving sparse algebraic equations over finite fields

Cites work

• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• MaxMinMax problem and sparse equations over finite fields
• On solving sparse algebraic equations over finite fields
• Solving multiple right hand sides linear equations
• Speeding up deciphering by hypergraph ordering

Cited in

(8)

• scientific article; zbMATH DE number 7300422 (Why is no real title available?)
• An application of discrete algorithms in asymmetric cryptography
• A combinatorial problem related to sparse systems of equations
• Impact of randomization in VKO mechanisms on overall security level
• Finite set theory and its application to cryptology
• scientific article; zbMATH DE number 5204734 (Why is no real title available?)
• scientific article; zbMATH DE number 3954809 (Why is no real title available?)
• Jordan derivations on prime rings

This page was built for publication: An application of combinatorics in cryptography

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