Euclid's algorithm and the Lanczos method over finite fields
نویسنده
چکیده
This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially when working over finite fields. It uses this relationship to account rigorously for the appearance of self-orthogonal vectors arising in the course of the Lanczos algorithm. It presents an improved Lanczos method which overcomes problems with self-orthogonality and compares this improved algorithm with the Euclidean algorithm.
منابع مشابه
Blocked Lanczos-style Algorithms over Small Finite Fields
Solutions to very large sparse systems of linear equations over small finite fields are essential in the best known algorithms for factoring integers and computing discrete logarithms. Due to the sizes of such systems, elimination-based approaches are impractical, so attention has shifted to iterative or black-box methods. This thesis examines one brand of such algorithms: those based on the La...
متن کاملAn integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2)
Integer factorization is known to be one of the most important and useful methods in number theory and arithmetic. It also has a very close relationship to some algorithms in cryptography such as RSA algorithm. The RSA cryptosystem is one of the most popular and attractive public-key cryptosystems in theworld today. Its security is based on thedifficulty of integer factorization. Solving a larg...
متن کاملDiamagnetic Properties of Doped Antiferromagnets
Finite-temperature diamagnetic properties of doped antiferromagnets as modeled by the two-dimensional t-J model were investigated by numerical studies of small model systems. Two numerical methods were used: the worldline quantum Monte Carlo method with a loop cluster algorithm (QMC) and the finite-temperature Lanczos method (FTLM), yielding consistent results. The diamagnetic susceptibility in...
متن کاملChallenges in Solving Large Sparse Linear Systems over Finite Fields∗
This talk outlines how very large, sparse linear systems arise in the solution of problems of interest in computational number theory and public-key cryptography, such as the integer factorization and discrete logarithm problems. The linear systems are over finite fields, often the field GF(2) of two elements. We describe some algorithms for solving large sparse linear systems over GF(2), and c...
متن کاملAccuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
The s-step Lanczos method is an attractive alternative to the classical Lanczos method as it enables an O(s) reduction in data movement over a fixed number of iterations. This can significantly improve performance on modern computers. In order for s-step methods to be widely adopted, it is important to better understand their error properties. Although the s-step Lanczos method is equivalent to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 67 شماره
صفحات -
تاریخ انتشار 1998