CSpace
solvingthemultidiscretelogarithmproblemsoveragroupofellipticcurveswithprimeorder
Li Junquan; Liu Mulan; Xiao Liangliang
2005
Source Publicationactamathematicasinicaenglishseries
ISSN1439-8516
Volume21Issue:6Pages:1443
AbstractIn 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.
Language英语
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/42752
Collection中国科学院数学与系统科学研究院
Affiliation中国科学院数学与系统科学研究院
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li Junquan]'s Articles
[Liu Mulan]'s Articles
[Xiao Liangliang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li Junquan]'s Articles
[Liu Mulan]'s Articles
[Xiao Liangliang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li Junquan]'s Articles
[Liu Mulan]'s Articles
[Xiao Liangliang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.