Sciweavers

170 search results - page 1 / 34
» Solving Sparse Integer Linear Systems
Sort
View
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 4 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
13 years 10 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
13 years 4 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo
COCOON
2000
Springer
13 years 9 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent
JSC
2006
147views more  JSC 2006»
13 years 4 months ago
An algorithm to solve integer linear systems exactly using numerical methods
In this paper, we present a new algorithm for the exact solutions of linear systems with integer coefficients using numerical methods. It terminates with the correct answer in wel...
Zhendong Wan