Large Scale Implementation Of The Block Lanczos Algorithm
Large sparse matrices arise in many applications, especially in the major problems of Cryptography of factoring integers and computing discrete logarithms. We focus attention on such matrices called sieve matrices generated after the sieving stage of the algorithms for integer factoring. We need to...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2005/820 |