2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.IT2013★ 2 cited
A generalization of bounds for cyclic codes, including the HT and BS bounds
Matteo Piva, Massimiliano Sala
We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic…
math.NT2011★ 2 cited
The Rabin cryptosystem revisited
Michele Elia, Matteo Piva, Davide Schipani
The Rabin public-key cryptosystem is revisited with a focus on the problem of identifying the encrypted message unambiguously for any pair of primes. In particular, a deterministic…
cs.CR2011
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…