23 citations · 59 across the 22 of their papers we have counts for
5 papers · 2 filters
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…
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…
Efficient evaluation of polynomials over finite fields
Davide Schipani, Michele Elia, Joachim Rosenthal
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be low…
Polynomial evaluation over finite fields: new algorithms and complexity bounds
Michele Elia, Joachim Rosenthal, Davide Schipani
An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial…
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
Davide Schipani, Michele Elia, Joachim Rosenthal
The standard algebraic decoding algorithm of cyclic codes up to the BCH bound is very efficient and practical for relatively small while it becomes unpractical fo…