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.
https://hal.inria.fr/inria-00614460 Contributor : Marie TrapeConnect in order to contact the contributor Submitted on : Thursday, August 11, 2011 - 3:05:12 PM Last modification on : Wednesday, November 29, 2017 - 10:26:42 AM Long-term archiving on: : Monday, November 12, 2012 - 3:18:19 PM
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⟩