Cryptology ePrint Archive: Report 2016/329

A modified block Lanczos algorithm with fewer vectors

Emmanuel Thomé

Abstract: The block Lanczos algorithm proposed by Peter Montgomery is an efficient means to tackle the sparse linear algebra problem which arises in the context of the number field sieve factoring algorithm and its predecessors. We present here a modified version of the algorithm, which incorporates several improvements: we discuss how to efficiently handle homogeneous systems and how to reduce the number of vectors stored in the course of the computation. We also provide heuristic justification for the success probability of our modified algorithm.

While the overall complexity and expected number of steps of the block Lanczos is not changed by the modifications presented in this article, we expect these to be useful for implementations of the block Lanczos algorithm where the storage of auxiliary vectors sometimes has a non-negligible cost.

Category / Keywords: foundations /

Original Publication (in the same form): Topics in Computational Number Theory inspired by Peter L. Montgomery

Date: received 24 Mar 2016

Contact author: Emmanuel Thome at inria fr

Available format(s): PDF | BibTeX Citation

Note: This article is based on work by the author contributed as chapter~7 in {Topics in Computational Number Theory inspired by Peter L. Montgomery}, by Joppe W. Bos and Arjen K. Lenstra, to be published by Cambdridge University Press.

Version: 20160325:082804 (All versions of this report)

Short URL: ia.cr/2016/329

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]