Some Results on Kloosterman Sums and their Minimal Polynomials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Some Results on Kloosterman Sums and their Minimal Polynomials

Abstract

This paper introduces two new results on Kloosterman sums and their minimal polynomials. We characterise ternary Kloosterman sums modulo 27. We also prove a congruence concerning the minimal polynomial over ℚ of a Kloosterman sum. This paper also serves as a survey of our recent results on binary Kloosterman sums modulo 16, 32, 64 and 128 with Petr Lisonek.
Fichier principal
Vignette du fichier
114.pdf (104.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00614460 , version 1 (11-08-2011)

Identifiers

  • HAL Id : inria-00614460 , version 1

Cite

Faruk Gölöglu, Gary Mcguire, Richard Moloney. Some Results on Kloosterman Sums and their Minimal Polynomials. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.405-412. ⟨inria-00614460⟩
72 View
188 Download

Share

Gmail Facebook X LinkedIn More