7 citations · 13 across the 5 of their papers we have counts for
6 papers
A note on an infeasible linearization of some block ciphers
Riccardo Aragona, Anna Rimoldi, Massimiliano Sala
A block cipher can be easily broken if its encryption functions can be seen as linear maps on a small vector space. Even more so, if its round functions can be seen as linear maps…
Fast matrix decomposition in F2
Enrico Bertolazzi, Anna Rimoldi
In this work an efficient algorithm to perform a block decomposition (and so to compute the rank) of large dense rectangular matrices with entries in is presented. D…
On the provable security of BEAR and LION schemes
Lara Maines, Matteo Piva, Anna Rimoldi +1
BEAR, LION and LIONESS are block ciphers presented by Biham and Anderson (1996), inspired by the famous Luby-Rackoff constructions of block ciphers from other cryptographic primiti…
On weakly APN functions and 4-bit S-Boxes
Claudio Fontanari, Valentina Pulice, Anna Rimoldi +1
S-Boxes are important security components of block ciphers. We provide theoretical results on necessary or sufficient criteria for an (invertible) 4-bit S-Box to be weakly APN. Tha…
Do AES encryptions act randomly?
Anna Rimoldi, Massimiliano Sala, Enrico Bertolazzi
The Advanced Encryption Standard (AES) is widely recognized as the most important block cipher in common use nowadays. This high assurance in AES is given by its resistance to ten…
A possible intrinsic weakness of AES and other cryptosystems
Anna Rimoldi, Massimiliano Sala, Ilia Toli
It has been suggested that the algebraic structure of AES (and other similar block ciphers) could lead to a weakness exploitable in new attacks. In this paper, we use the algebraic…