Many new ciphers target a concise algebraic description for efficient evaluation in a proof
system or a multi-party computation. This new target for optimization introduces algebraic …

In this paper, we examine algebraic attacks on the O'zDSt 1105: 2009. We begin with a brief
review of the meaning of algebraic cryptanalysis, followed by an algebraic cryptanalysis of …

Solving a system of m multivariate quadratic equations in n variables over finite fields (the
MQ problem) is one of the important problems in the theory of computer science. The XL …

In this article we investigate algorithms for solving non-linear multivariate equations over
finite fields and the relation between them. For non binary fields usually computing the …

The literature on the topic of methods for solving polynomial systems over F2 is extensively
developed but lacks internal consistency: there are, for example, di erent choices of …

Due to advancements in quantum computer algorithms, the cryptographic community is
exploring alternatives to traditional hardness assumptions, such as the discrete logarithm …

Solving non-linear and in particular Multivariate Quadratic equations over finite fields is an
important cryptanalytic problem. Apart from needing exponential time in general, we also …

Bereits im ersten Jahr lernte ich Dr. Enrico Thomae, Dr. Christopher Wolf und Marina
Efimenko von der Ruhr-Universität Bochum kennen und wir begannen gemeinsam zu …

A well known birthday paradox is one the most important problems in cryptographic
applications. Incremental hash functions or digital signatures in public key cryptography and …