solvingthemultidiscretelogarithmproblemsoveragroupofellipticcurveswithprimeorder
文献类型：期刊论文
| 作者 | Li Junquan; Liu Mulan; Xiao Liangliang |
| 刊名 | actamathematicasinicaenglishseries
 |
| 出版日期 | 2005 |
| 卷号 | 21期号:6页码:1443 |
| ISSN号 | 1439-8516 |
| 英文摘要 | 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. |
| 语种 | 英语 |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/42751]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | 中国科学院数学与系统科学研究院 |
| 推荐引用方式 GB/T 7714 | Li Junquan,Liu Mulan,Xiao Liangliang. solvingthemultidiscretelogarithmproblemsoveragroupofellipticcurveswithprimeorder[J]. actamathematicasinicaenglishseries,2005,21(6):1443. |
| APA | Li Junquan,Liu Mulan,&Xiao Liangliang.(2005).solvingthemultidiscretelogarithmproblemsoveragroupofellipticcurveswithprimeorder.actamathematicasinicaenglishseries,21(6),1443. |
| MLA | Li Junquan,et al."solvingthemultidiscretelogarithmproblemsoveragroupofellipticcurveswithprimeorder".actamathematicasinicaenglishseries 21.6(2005):1443. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。