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 math.NTShow all

9 papers · 1 filter

math.NT2013★ 1 cited

On Canonical Subfield Preserving Polynomials

Giacomo Micheli, Davide Schipani

Explicit monoid structure is provided for the class of canonical subfield preserving polynomials over finite fields. Some classical results and asymptotic estimates will follow as…

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…

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…

math.NT2011

Gauss sums of cubic characters over , odd

Michele Elia, Davide Schipani

An elementary approach is shown which derives the values of the Gauss sums over , odd, of a cubic character without using Davenport-Hasse's theorem. New links…

math.NT2010★ 5 cited

Improvements on Cantor-Zassenhaus Factorization Algorithm

Michele Elia, Davide Schipani

After revisiting Cantor-Zassenhaus polynomial factorization algorithm, we describe a new simplified version of it, which requires less computational cost. Moreover we show that it…

math.NT2010

Gauss Sums of the Cubic Character over : an elementary derivation

Davide Schipani, Michele Elia

An elementary approach is shown which derives the value of the Gauss sum of a cubic character over a finite field without using Davenport-Hasse's theorem (namely,…