Information Technology Reference
In-Depth Information
3. Charpin, P., Gong, G.: Hyperbent Functions, Kloosterman Sums and Dickson Poly-
nomials. IEEE Trans. Inform. Theory (to appear)
4. Charpin, P., Helleseth, T., Zinoviev, V.: Propagation Characteristics of x → x 1
and Kloosterman Sums. Finite Fields Appl. 13, 366-381 (2007)
5. Enge, A.: Elliptic Curves and Their Applications to Cryptography: An Introduc-
tion. Kluwer Academic Publishers, Boston (1999)
6. Garaschuk, K., Lisonek, P.: On Ternary Kloosterman Sums modulo 12. Finite
Fields Appl. (to appear)
7. Helleseth, T., Zinoviev, V.: On Z 4 -linear Goethals Codes and Kloosterman Sums.
Des. Codes Cryptogr. 17, 269-288 (1999)
8. Hirschfeld, J.W.P.: Projective Geometries over Finite Fields, 2nd edn. The Claren-
don Press, Oxford University Press, New York (1998)
9. Lachaud, G., Wolfmann, J.: The Weights of the Orthogonals of the Extended
Quadratic Binary Goppa Codes. IEEE Trans. Inform. Theory 36, 686-692 (1990)
10. Leonard, P.A., Williams, K.S.: Quartics over GF(2 n ). Proc. Amer. Math. Soc. 36,
347-350 (1972)
11. Lercier, R., Lubicz, D., Vercauteren, F.: Point Counting on Elliptic and Hyperel-
liptic Curves. In: Cohen, H., Frey, G. (eds.) Handbook of Elliptic and Hyperelliptic
Curve Cryptography. Chapman & Hall/CRC, Boca Raton (2006)
12. Menezes, A.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publish-
ers, Boston (1993)
13. Moisio, M.: Kloosterman Sums, Elliptic Curves, and Irreducible Polynomials with
Prescribed Trace and Norm. Acta Arithmetica (to appear)
14. Moisio, M., Ranto, K.: Kloosterman Sum Identities and Low-weight Codewords in
a Cyclic Code with Two Zeros. Finite Fields Appl. 13, 922-935 (2007)
 
Search WWH ::




Custom Search