The Space Complexity Analysis in the General Number Field Sieve Integer Factorization-Reference-Cited by-同舟云学术

The Space Complexity Analysis in the General Number Field Sieve Integer Factorization

Published:2016-05 Issue: Volume:630 Page:76-94
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Wang Qi,Fan Xiubin,Zang Hongyan,Wang Yu

Funder

State Key Basic Research and Development Plan

Milky Way High Performance Computing foundation

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. New direction in cryptography;Diffie;IEEE Trans. Inf. Theory,1976

2. A method for obtaining digital signatures and public-keycryptosystems;Rivest;Commun. ACM,1978

3. The Development of the Number Field Sieve,1993

4. Factorization of a 768-bit RSA modulus;Kleinjung,2010

5. Polynomial selection for the number field sieve integer factorization algorithm;Murphy,1999

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. P System Design for Integer Factorization;Applied Sciences;2023-08-02

2. A Study on Optimization of Sparse and Dense Linear System Solver Over GF(2) on GPUs;Innovations in Computer Science and Engineering;2021

3. A New Approach Based on Parallel Probabilistic to Factorize a Semiprime;2019 International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData);2019-07

4. Solving future equation systems using integral-type error function and using twice ZNN formula with disturbances suppressed;Journal of the Franklin Institute;2019-03

5. An improved parallel block Lanczos algorithm over GF(2) for integer factorization;Information Sciences;2017-02