ALGORITHMS FOR KLOOSTERMAN ZEROS
暂无分享,去创建一个
[1] L. Carlitz. Kloosterman sums and finite field extensions , 1969 .
[2] J. Dillon. Elementary Hadamard Difference Sets , 1974 .
[3] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .
[4] René Schoof,et al. Nonsingular plane cubic curves over finite fields , 1987, J. Comb. Theory A.
[5] G. Lachaud,et al. The weights of the orthogonals of the extended quadratic binary Goppa codes , 1990, IEEE Trans. Inf. Theory.
[6] Marcel van der Vlugt,et al. Kloosterman sums and thep-torsion of certain Jacobians , 1991 .
[7] Keith O. Geddes,et al. Algorithms for computer algebra , 1992 .
[8] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.
[9] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..
[10] Joachim von zur Gathen,et al. Modern Computer Algebra , 1998 .
[11] Nigel P. Smart,et al. Elliptic Curves in Cryptography: Preface , 1999 .
[12] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .
[13] Andreas Enge,et al. Elliptic Curves and Their Applications to Cryptography , 1999, Springer US.
[14] Tor Helleseth,et al. On Z4-Linear Goethals Codes and Kloosterman Sums , 1999, Des. Codes Cryptogr..
[15] Amr M. Youssef,et al. Hyper-bent Functions , 2001, EUROCRYPT.
[16] Claude Carlet,et al. Hyper-bent functions and cyclic codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[17] Miroslav Goljan,et al. Writing on wet paper , 2005 .
[18] Frederik Vercauteren,et al. Point Counting on Elliptic and Hyperelliptic Curves , 2005 .
[19] Tanja Lange,et al. Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .
[20] Tor Helleseth,et al. Propagation characteristics of xx-1 and Kloosterman sums , 2007, Finite Fields Their Appl..
[21] Petr Lisonek,et al. On the Connection between Kloosterman Sums and Elliptic Curves , 2008, SETA.
[22] Petr Lisonek,et al. On ternary Kloosterman sums modulo 12 , 2008, Finite Fields Their Appl..
[23] Petr Lisonek,et al. On binary Kloosterman sums divisible by 3 , 2008, Des. Codes Cryptogr..
[24] Guang Gong,et al. Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials , 2008, IEEE Trans. Inf. Theory.
[25] M. Moisio,et al. Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm , 2007, 0706.2112.
[26] Norman R. Reilly,et al. Introduction to Applied Algebraic Systems , 2009 .
[27] G. McGuire,et al. Ternary Kloosterman sums using Stickelberger's theorem and the Gross-Koblitz formula , 2010, 1005.4548.
[28] Keijo O. Väänänen,et al. On Integer Values of Kloosterman Sums , 2010, IEEE Transactions on Information Theory.
[29] Marko J. Moisio,et al. On zeros of Kloosterman sums , 2011, Des. Codes Cryptogr..