Constructive and destructive facets of Weil descent on elliptic curves

作者: P. Gaudry , F. Hess , N. P. Smart

DOI: 10.1007/S00145-001-0011-X

关键词:

摘要: In this paper we look in detail at the curves which arise method of Galbraith and Smart for producing Weil restriction an elliptic curve over a finite field characteristic 2 composite degree. We explain how can be used to construct hyperelliptic cryptosystems could as secure based on original curve. On other hand, show that same technique may provide way attacking cryptosystem using recent advances study discrete logarithm problem curves. We examine resulting higher genus some propose additional check systems defined fields so make them immune from methods paper.

参考文章(18)
Pierrick Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves theory and application of cryptographic techniques. ,vol. 1807, pp. 19- 34 ,(2000) , 10.1007/3-540-45539-6_2
Joseph H. Silverman, The Arithmetic of Elliptic Curves ,(1986)
John Torrence Tate, Emil Artin, Class Field Theory ,(1990)
Jürgen Neukirch, Algebraic Number Theory ,(1999)
Preda Mihailescu, F Pappalardi, Elliptic Curves in Cryptography ,(1999)
Steven D. Galbraith⋆, Nigel P. Smart, A cryptographic application of Weil descent Lecture Notes in Computer Science. pp. 191- 200 ,(1999) , 10.1007/3-540-46665-7_23
Henning Stichtenoth, Algebraic Function Fields and Codes ,(1993)
Nigel P. Smart, On the performance of hyperelliptic cryptosystems theory and application of cryptographic techniques. ,vol. 1592, pp. 165- 175 ,(1999) , 10.1007/3-540-48910-X_12