activity
20072018
most citedOn the Decoding Complexity of Cyclic Codes Up to the BCH Bound

23 citations · 59 across the 22 of their papers we have counts for

collaborators
Showing 2011Show all

10 papers · 1 filter

cs.CR2011

On the Rabin signature

Michele Elia, Davide Schipani

Some Rabin signature schemes may be exposed to forgery; several variants are here described to counter this vulnerability. Blind Rabin signatures are also discussed.

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.IT2011★ 6 cited

Enhanced public key security for the McEliece cryptosystem

Marco Baldi, Marco Bianchi, Franco Chiaraluce +2

This paper studies a variant of the McEliece cryptosystem able to ensure that the code used as the public key is no longer permutation-equivalent to the secret code. This increases…

math.NT2011

Additive decompositions induced by multiplicative characters over finite fields

Davide Schipani, Michele Elia

In 1952, Perron showed that quadratic residues in a field of prime order satisfy certain ad- ditive properties. This result has been generalized in different directions, and our co…

cs.IT2011

On fuzzy syndrome hashing with LDPC coding

Marco Baldi, Marco Bianchi, Franco Chiaraluce +2

The last decades have seen a growing interest in hash functions that allow some sort of tolerance, e.g. for the purpose of biometric authentication. Among these, the syndrome fuzzy…

cs.CR2011

Managing key multicasting through orthogonal systems

Jose' Antonio Alvarez-Bermejo, Juan Antonio Lopez-Ramos, Joachim Rosenthal +1

In this paper we propose a new protocol to manage multicast key distribution. The protocol is based on the use of orthogonal systems in vector spaces. The main advantage in compari…