Proceedings of the 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering 2015

Space Complexity Analysis of Sieving in the Number Field Sieve Integer Factorization

Authors
Qi Wang, Hongyan Zang, Xiubin Fan, Yu Wang
Corresponding Author
Qi Wang
Available Online December 2015.
DOI
https://doi.org/10.2991/icmmcce-15.2015.70How to use a DOI?
Keywords
number field sieve, integer factorization, mathematical expectation, evaluation, space complexity
Abstract
The general number sieve is the most efficient algorithm known integer factorization, it consists of polynomial selection, sieving, solving equations and finding square roots. In this paper, the evaluation provided by each root and the expected value are given, then we get the space complexity of sieving over the ring .
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2015 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering
Part of series
Advances in Computer Science Research
Publication Date
December 2015
ISBN
978-94-6252-133-9
DOI
https://doi.org/10.2991/icmmcce-15.2015.70How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Qi Wang
AU  - Hongyan Zang
AU  - Xiubin Fan
AU  - Yu Wang
PY  - 2015/12
DA  - 2015/12
TI  - Space Complexity Analysis of Sieving in the Number Field Sieve Integer Factorization
BT  - 2015 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering
PB  - Atlantis Press
UR  - https://doi.org/10.2991/icmmcce-15.2015.70
DO  - https://doi.org/10.2991/icmmcce-15.2015.70
ID  - Wang2015/12
ER  -