Constructive and destructive facets of Weil descent on elliptic curves

被引:0
作者
P. Gaudry
F. Hess
N. P. Smart
机构
[1] LIX,School of Mathematics and Statistics F07
[2] École Polytechnique,Computer Science Department
[3] University of Sydney,undefined
[4] University of Bristol,undefined
来源
Journal of Cryptology | 2002年 / 15卷
关键词
Function fields; Divisor class group; Cryptography; Elliptic curves;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper we look in detail at the curves which arise in the method of Galbraith and Smart for producing curves in the Weil restriction of an elliptic curve over a finite field of characteristic 2 of composite degree. We explain how this method can be used to construct hyperelliptic cryptosystems which could be as secure as cryptosystems based on the original elliptic curve. On the other hand, we show that the same technique may provide a way of attacking the original elliptic curve cryptosystem using recent advances in the study of the discrete logarithm problem on hyperelliptic curves.
引用
收藏
页码:19 / 46
页数:27
相关论文
共 7 条
[1]  
Cantor D.G.(1987)Computing in the Jacobian of a hyperelliptic curve Math. Comp. 48 95-101
[2]  
Frey G.(1994)A remark concerning Math. Comp. 62 865-874
[3]  
Rück H.-G.(1999)-divisibility and the discrete logarithm problem in the divisor class group of curves Math. Comp. 68 807-822
[4]  
Müller V.(1985)Computing discrete logarithms in real quadratic function fields of large genus Math. Comp. 44 483-494
[5]  
Stein A.(undefined)Elliptic curves over finite fields and the computation of square roots mod undefined undefined undefined-undefined
[6]  
Thiel C.(undefined)undefined undefined undefined undefined-undefined
[7]  
Schoof R.(undefined)undefined undefined undefined undefined-undefined