You are looking at a specific version 20090609:150319 of this paper.
See the latest version.
Paper 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)
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Diplomarbeit, submitted Summer 2008
- Keywords
- algebraic attacksmultivariate polynomialsboolean functions
- Contact author(s)
- thomas dullien @ rub de
- History
- 2009-06-09: received
- Short URL
- https://ia.cr/2009/275
- License
-
CC BY