28 citations · 173 across the 55 of their papers we have counts for
4 papers · 1 filter
Complexity of multivariate polynomial evaluation
Edoardo Ballico, Michele Elia, Massimiliano Sala
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.
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…
Improved decoding of affine-variety codes
Chiara Marcolla, Emmanuela Orsini, Massimiliano Sala
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for…
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…