×

zbMATH — the first resource for mathematics

Optimization strategies for hardware-based cofactorization. (English) Zbl 1267.11121
Jacobson, Michael J. jun. (ed.) et al., Selected areas in cryptography. 16th annual international workshop, SAC 2009, Calgary, Alberta, Canada, August 13–14, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-05443-3/pbk). Lecture Notes in Computer Science 5867, 170-181 (2009).
Summary: We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorization step on a hardware cluster. An optimal distribution of bitlength-specific ECM modules is proposed and compared to existing ones. With our optimizations we obtain a speedup between 17% and 33% of the cofactorization step of the GNFS when compared to the runtime of an unoptimized cluster.
For the entire collection see [Zbl 1177.94012].
MSC:
11Y05 Factorization
PDF BibTeX XML Cite
Full Text: DOI