An application of combinatorics in cryptography

DOI10.1016/J.ENDM.2015.06.006zbMATH Open1401.94160OpenAlexW2221344989MaRDI QIDQ322183FDOQ322183

Igor Semaev, Peter Horák, Zsolt Tuza

Publication date: 14 October 2016

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

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

zbMATH Keywords

computational complexityalgebraic cryptanalysissparse system of equations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• An application of discrete algorithms in asymmetric cryptography
• Title not available (Why is that?)
• Finite set theory and its application to cryptology
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)