Michael Brickenstein

Learn More
This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modelled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two(More)
This work is devoted to attacking the small scale variants of the Advanced Encryption Standard (AES) via systems that contain only the initial key variables. To this end, we introduce a system of equations that naturally arises in the AES, and then eliminate all the intermediate variables via normal form reductions. The resulting system in key variables(More)
An information service for mathematical software is presented. Publications and software are two closely connected facets of mathematical knowledge. This relation can be used to identify mathematical software and find relevant information about it. The approach and the state of the art of the information service are described here.
We overview numerous algorithms in computational D-module theory together with the theoretical background as well as the implementation in the computer algebra system Singular. We discuss new approaches to the computation of Bern-stein operators, of logarithmic annihilator of a polynomial, of annihilators of rational functions as well as complex powers of(More)
We apply the PolyBoRi framework for Gröbner bases computations with Boolean polynomials to bit-valued problems from algebraic cryptanalysis and formal verification. First, we proposed zero-suppressed binary decision diagrams (ZDDs) as a suitable data structure for Boolean poly-nomials. Utilizing the advantages of ZDDs we develop new reduced normal form(More)
  • 1