Parameter trade-offs for NFS and ECM

DOI10.1007/978-3-319-97916-8_8zbMath1398.11154OpenAlexW2883253384MaRDI QIDQ1800722

Kazumaro Aoki

Publication date: 24 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-97916-8_8

zbMATH Keywords

time complexityECMnumber field sievesuccess probabilityelliptic curve methodmemory complexityNFS

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

This page was built for publication: Parameter trade-offs for NFS and ECM