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.
Type de document :
Communication dans un congrès
WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.405-412, 2011
https://hal.inria.fr/inria-00614460
Contributeur : Marie Trape
<>
Soumis le : jeudi 11 août 2011 - 15:05:12
Dernière modification le : mercredi 29 novembre 2017 - 10:26:42
Document(s) archivé(s) le : lundi 12 novembre 2012 - 15:18:19
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, 2011. 〈inria-00614460〉
