• Publications
  • Influence
Factoring polynomials with rational coefficients
In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into
The XTR Public Key System
This paper introduces the XTR public key system, a new method to represent elements of a subgroup of a multiplicative group of a finite field that leads to substantial savings both in communication and computational overhead without compromising security.
Selecting Cryptographic Key Sizes
Recommendations for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm-based cryptosSystems both over finite fields and over groups of elliptic curves over prime fields are offered.
Factorization of a 768-Bit RSA Modulus
This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.
A random zoo: sloth, unicorn, and trx
It is shown how sloth can be used for uncontestable random number generation (unicorn), and how unicorn can be use for a new trustworthy random ellip­ tic curves service (trx) and random-sample.
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 250calls to the MD5 compression function, for any two
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
A more flexible family of differential paths and a new variable birthdaying search space are described, leading to just three pairs of near-collision blocks to generate the collision, enabling construction of RSA moduli that are sufficiently short to be accepted by current CAs.
Hard Equality Constrained Integer Knapsacks
It is demonstrated that the characteristics that make the instances so difficult to solve by branch-and-bound make the solution of a certain reformulation of the problem almost trivial.
The Development of the Number Field Sieve
The number field sieve is an algorithm to factor integers of the form $r^e-s$ for small positive $r$ and $s$. The authors present a report on work in progress on this algorithm. They informally
The number field sieve
A heuristic run time analysis indicates that the number field sieve is asymptotically substantially faster than any other known factoring method, for the integers that it applies to, and can be modified to handle arbitrary integers.