Algebraic Attacks specialized to \(\mathbb{F}_2\) (Diplomarbeit)

Thomas Dullien

Paper 2009/275 Original: eprint.iacr.org/2009/275 ↗

Algebraic Attacks specialized to \(\mathbb{F}_2\) (Diplomarbeit)

Thomas Dullien

Abstract

This thesis studies the ring of boolean functions. A simple algorithm that performs similarly to the euclidian algorithm is derived, and it's performance for solving multivariate boolean equation systems is evaluated. Furthermore, the Raddum-Semaev equation system solving algorithm is put into geometric context, and the pseudo-euclidian algorithm is generalized to multivariate polynomial rings over arbitrary finite fields.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Preprint.
History: 2009-06-09: last updated; 2009-06-09: published
Short URL: https://ia.cr/2009/275
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2009/275,
      author = {Thomas Dullien},
      title = {Algebraic Attacks specialized to \(\mathbb{F}_2\) (Diplomarbeit)},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/275},
      year = {2009},
      url = {https://eprint.iacr.org/2009/275}
}