In this paper, we study algorithmic aspects of linear ordinary integro-differential operators with polynomial coefficients. Even though this algebra is not noetherian and has zero divisors, Bavula recently proved that it is coherent, which allows one to develop an algebraic systems theory. For an algorithmic approach to linear systems theory of integro-differential equations with boundary condi...

We propose a candidate, which we call the fractional Galois ideal after Snaith’s fractional ideal, for replacing the classical Stickelberger ideal associated to an abelian extension of number fields. The Stickelberger ideal can be seen as gathering information about those L-functions of the extension which are non-zero at the special point s = 0, and was conjectured by Brumer to give annihilato...

Algebraic attacks on block ciphers and stream ciphers have gained more and more attention in cryptography. Their idea is to express a cipher by a system of equations whose solution reveals the secret key. The complexity of an algebraic attack generally increases with the degree of the equations. Hence, low-degree equations are crucial for the efficiency of algebraic attacks. In the case of simp...

Since 2003, Algebraic Attacks have received a lot of attention in the cryptography literature. In this context, algebraic immunity quantifies the resistance of a Boolean function to the standard algebraic attack of the pseudo-random generators using it as a nonlinear Boolean function. A high value of algebraic immunity is now an absolutely necessary cryptographic criterion for a resistance to a...