期刊
THEORETICAL COMPUTER SCIENCE
卷 630, 期 -, 页码 76-94出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2016.03.028
关键词
General Number Field Sieve; Integer factorization; Mathematical expectation; p-adic evaluation; Computational complexity; Space complexity
资金
- State Key Basic Research and Development Plan [2013CB338003]
- Milky Way High Performance Computing foundation
The General Number Sieve is the most efficient algorithm for integer factorization. It consists of polynomial selection, sieving, solving equations and finding square roots. Root lifting of polynomial is discussed in this paper. The p-adic evaluation provided by each root and the expected p-value are also given. Then we gain the space complexity of sieving and building equations over the ring Z/2Z. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据