Abstract
This paper analyzes two factoring algorithms, NFS (Number Field Sieve) and ECM (Elliptic Curve Method). The previous results only minimize their running times, however, we may need to minimize the storage size or running time with smaller success probability. We provide these trade-offs, L[s] (s≤ 1 / 3 ) memory requires L[ 1 - 2 s] running time for NFS, for example. This can be interpreted that NFS requires much more running time when reducing memory complexity.
Author supplied keywords
Cite
CITATION STYLE
Aoki, K. (2018). (Short Paper) Parameter Trade-Offs for NFS and ECM. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11049 LNCS, pp. 114–123). Springer Verlag. https://doi.org/10.1007/978-3-319-97916-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
