Cart (Loading....) | Create Account
Close category search window
 

Binary Kloosterman Sums Modulo 256 and Coefficients of the Characteristic Polynomial

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gologlu, F. ; Sch. of Math. Sci., Univ. Coll. Dublin, Dublin, Ireland ; Lisonek, P. ; McGuire, G. ; Moloney, R.

Kloosterman sums are exponential sums on finite fields that have important applications in cryptography and coding theory. We use Stickelberger's theorem and the Gross-Koblitz formula to determine the value of the binary Kloosterman sum at a modulo 64, modulo 128, and modulo 256 in terms of coefficients of the characteristic polynomial of a.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 4 )

Date of Publication:

April 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.