In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, K. Aardal, A. K. Lenstra, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
Decomposition of integer matrices and multileaf collimator sequencing. Discrete Applied (2008)
In K. Aardal, G. L. Nemhauser, R. Weismantel, Book On Discrete, K. Aardal, A. K. Lenstra, ...
[1] K. Aardal. Comments on the paper: Attacking the market split problem with lattice point
1 Factorization of a 512--bit RSA Modulus (2007)
S. Cavallar, W. M. Lioen, B. Dodson, A. K. Lenstra, P. L. Montgomery, ...
and their applications. SMC is sponsored by the Netherlands Organization for
Factorization of a 512-bit RSA modulus (2000)
S. Cavallar, W. M. Lioen, B. Dodson, A. K. Lenstra, P. L. Montgomery, ...
and their applications. SMC is sponsored by the Netherlands Organization for
Factorization of a 512-bit RSA modulus (2000)
S. Cavallar, W. M. Lioen, B. Dodson, A. K. Lenstra, P. L. Montgomery, ...
and their applications. SMC is sponsored by the Netherlands Organization for
Market split and basis reduction: Towards a solution of the Cornuejols-Dawande Instances (1999)
Aardal, K.I., Bixby, R.E., Hurkens, C.A.J., Lenstra, A.K., Smeltink, J.W.
Factorization of RSA-140 Using the Number Field Sieve (1999)
S. Cavallar, B. Dodson, A. K. Lenstra, P. Leyl, W. M. Lioen, P. L. Montgomery, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Market split and basis reduction: Towards a solution of the Cornuejols-Dawande instances (1999)
K. Aardal, R. E. Bixby, A. K. Lenstra, J. W. Smeltink
At the IPCO VI conference Cornuejols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear...
Factorization of RSA-140 Using the Number Field Sieve (1999)
S. Cavallar, B. Dodson, A. K. Lenstra, P. C. Leyl, W. M. Lioen, P. L. Montgomery, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Market Split and Basis Reduction: Towards a Solution of the Cornuejols-Dawande Instances (1999)
Aardal Bixby Hurkens, K. Aardal, K. Aardal, R. E. Bixby, R. E. Bixby, ...
At the IPCO VI conference Cornuejols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear...
Solving a system of diophantine equations with lower and upper bounds on the variables (1998)
Aardal, K.I., Hurkens, C., Lenstra, A.K.
We develop an algorithm for solving a system of diophantine equations with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction. It rst nds a short vector...
An algorithm for solving a diophantine equation with lower and upper bounds on the variables (1997)
Aardal, K.I., Hurkens, C., Lenstra, A.K.
We develop an algorithm for solving a diophantine equation with lower and upper bounds on the variables. The algorithm is based on lattice basis reduction, and rst nds short vectors satisfying the...
On the factorization of RSA-120 (1994)
Denny Dodson, T. Denny, B. Dodson, A. K. Lenstra, M. S. Manasse
. We present data concerning the factorization of the 120-digit number RSA-120, which we factored on July 9, 1993, using the quadratic sieve method. The factorization took approximately 825 MIPS...
On the factorization of RSA-120 (1994)
T. Denny, B. Dodson, A. K. Lenstra, M. S. Manasse, Lehrstuhl Prof Buchmann, ...
Abstract. We present data concerning the factorization of the 12O-digit number RSA-120, which we factored on July 9,1993, using the quadratic sieve method. The factorization took approximately 825...
A. K. Lenstra, M. S. Manasse, J. M. Pollard
Abstract. The number field sieve is an algorithm to factor integers of the form r e ± s for small positive r and s. This note is intended as a ‘report on work in progress ’ on this algorithm. We...