In previous works we considered codes defined as ideals of quotients of skew polynomial rings, so called Ore rings of automorphism type. In this paper we consider codes defined a...
Let f : F n 2 → F n 2 be an almost perfect nonlinear function (APN). The set Df := {(a, b) : f(x + a) − f(x) = b has two solutions} can be used to distinguish APN functions up ...
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...
Abstract. In this paper we present a theoretical framework to quantify the information brought by several linear approximations of a blockcipher without putting any restriction on ...
The Rayleigh quotient of a bent function is an invariant under the action of the orthogonal group, and it measures the distance of the function to its dual. An efficient algorithm ...
Lars Eirik Danielsen, Matthew G. Parker, Patrick S...
Cache timing attacks are a class of side-channel attacks that is applicable against certain software implementations. They have generated significant interest when demonstrated ag...
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
In previous work we showed how to compress certain prime-order subgroups of the cyclotomic subgroups of orders 22m + 1 of the multiplicative groups of F∗ 24m by a factor of 4. We...
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...