中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order

文献类型:期刊论文

作者Li, JQ; Liu, ML; Xiao, LL
刊名ACTA MATHEMATICA SINICA-ENGLISH SERIES
出版日期2005-12-01
卷号21期号:6页码:1443-1450
关键词Pollard's rho method parallel collision search algorithm elliptic curve discrete logarithm distinguished point
ISSN号1439-8516
DOI10.1007/s10114-005-0632-3
英文摘要In this paper, we discuss the expected number of steps in solving multi-discrete logarithm problems over a group of elliptic curves with prime order by using Pollard's rho method and parallel collision search algorithm. We prove that when using these algorithms to compute discrete logarithms, the knowledge gained through computing many logarithms does not make it easier for finding other logarithms. Hence in an elliptic cryptosystem, it is safe for many users to share the same curve, with different private keys.
WOS研究方向Mathematics
语种英语
WOS记录号WOS:000236388600020
出版者SPRINGER HEIDELBERG
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/1545]  
专题中国科学院数学与系统科学研究院
通讯作者Li, JQ
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Math Mechanizat, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Li, JQ,Liu, ML,Xiao, LL. Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order[J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES,2005,21(6):1443-1450.
APA Li, JQ,Liu, ML,&Xiao, LL.(2005).Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order.ACTA MATHEMATICA SINICA-ENGLISH SERIES,21(6),1443-1450.
MLA Li, JQ,et al."Solving the multi-discrete logarithm problems over a group of elliptic curves with prime order".ACTA MATHEMATICA SINICA-ENGLISH SERIES 21.6(2005):1443-1450.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。