An application of combinatorics in cryptography

DOI10.1016/j.endm.2015.06.006zbMath1401.94160OpenAlexW2221344989MaRDI QIDQ322183

Zsolt Tuza, I. A. Semaev, Peter Horák

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

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

Related Items (1)

Unnamed Item

Cites Work

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

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