(Short Paper) Parameter Trade-Offs for NFS and ECM

Autor:	Kazumaro Aoki
Rok vydání:	2018
Předmět:	Computer science Trade offs Short paper 010103 numerical & computational mathematics Parallel computing 01 natural sciences Running time General number field sieve 010101 applied mathematics Factoring Elliptic curve method Data_FILES 0101 mathematics Time complexity
Zdroj:	Advances in Information and Computer Security ISBN: 9783319979151 IWSEC
DOI:	10.1007/978-3-319-97916-8_8
Popis:	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\le 1/3\)) memory requires \(L[1-2s]\) running time for NFS, for example. This can be interpreted that NFS requires much more running time when reducing memory complexity.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::40c0f8dc3a78ec6ee190bbf374b82d50 https://doi.org/10.1007/978-3-319-97916-8_8 Zobrazit plný text záznamu