Speeding up Deciphering by Hypergraph Ordering

@article{Hork2015SpeedingUD,
  title={Speeding up Deciphering by Hypergraph Ordering},
  author={Peter Hor{\'a}k and Zsolt Tuza},
  journal={Des. Codes Cryptography},
  year={2015},
  volume={75},
  pages={175-185}
}
The “Gluing Algorithm” of Semaev [Des. Codes Cryptogr. 49 (2008), 47–60] — that finds all solutions of a sparse system of linear equations over the Galois field GF (q) — has average running time O(mq| k 1Xj |), where m is the total number of equations, and ∪k1Xj is the set of all unknowns actively occurring in the first k equations. Our goal here is to minimize the exponent of q in the case where every equation contains at most three unknowns. The main result states that if the total number… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
2 Citations
8 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Spaenlehauer , On the complexity of solving quadratic Boolean systems

  • J-C. Faugère M. Bardet, B. Salvy, P-J.
  • J . Complexity
  • 2013

Algebraic of block ciphers with over-defined systems of equations” in Advances of Cryptology Asiacrypt 2002

  • N. Courtois, J. Pierzyk
  • LNCS 2501, Springer
  • 2002
1 Excerpt

Sparse Matrices (Part of the Mathematics in Science & Engineering series)

  • R. P. Tewarson, P Reginald
  • 1973
1 Excerpt

Algebraic of block ciphers with overdefined systems of equations ”

  • J. Pierzyk
  • Advances of Cryptology Asiacrypt

Similar Papers

Loading similar papers…