Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Factorization of a 768-Bit RSA Modulus

- T. Kleinjung, Kazumaro Aoki,
+10 authors P. Zimmermann - MathematicsCRYPTO
- 15 August 2010

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.

Factorization of a 512-Bit RSA Modulus

- S. Cavallar, B. Dodson,
+14 authors P. Zimmermann - MathematicsEUROCRYPT
- 14 May 2000

This paper reports on the factorization of the 512-bit number RSA-155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

Factorization of RSA-140 Using the Number Field Sieve

- S. Cavallar, B. Dodson,
+6 authors P. Zimmermann - Computer ScienceASIACRYPT
- 1999

TLDR

Computations concerning the conjecture of Mertens.

- H. Riele
- Physics
- 1979

A self-contained data acquisition device or probe capable of monitoring any physical function that can be translated into an analog or digital signal. The data acquisition probe is coupled to a… Expand

Proceedings of the European Congress of Mathematics

- A. Ran, H. Riele, J. Wiegerinck
- Mathematics
- 2010

Iteration of number-theoretic functions

- H. Riele
- Mathematics
- 1983

This is a concise survey of literature on sequences which arise when a number-theoretic function f : 1N • 1N is iteratively applied to a given starting number. Many of the functions f discussed are… Expand

Factorization of RSA-140 Using the Number Field Sieve

- S. Cavallar, B. Dodson,
+6 authors P. Zimmermann - Computer Science, MathematicsCRYPTO
- 14 November 1999

On February 2, 1999, we completed the factorization of the 140-digit number RSA-140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The… Expand

Algorithms and applications on vector and parallel computers

- H. Riele, T. Dekker, H. A. Vorst
- Computer Science
- 1 October 1987

TLDR

Factoring with the quadratic sieve on large vector computers

- H. Riele, Walter M. Lioen, D. Winter
- Computer Science, Mathematics
- 1 September 1989

A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers

- R. Brent, A. V. D. Poorten, H. Riele
- Mathematics, Computer ScienceANTS
- 18 May 1996

The obvious way to compute the continued fraction of a real number α > 1 is to compute a very accurate numerical approximation of α, and then to iterate the well-known truncate-and-invert step which… Expand

...

1

2

3

4

5

...