H. Riele

发表

Factorization of RSA-140 Using the Number Field Sieve

Walter M. Lioen, A. K. Lenstra, P. Zimmermann, 1999, CRYPTO 1999.

Number Theory Elementary Number Theory

Jonathan M. Borwein, Igor E. Shparlinski, David H. Bailey, 2016 .

Reportrapport Factorization of a 512--bit Rsa Modulus Factorization of a 5122bit Rsa Modulus

Walter M. Lioen, A. K. Lenstra, P. L. Montgomery, 2022 .

Fair representation: Meeting the ideal of one man, one vote: Michel L. BALINSKI and H. Peyton YOUNG Yale University Press, New Haven, 1982, xi + 191 pages, £21.00

H. Riele, 1984 .

The proportional representation problem in the Second Chamber: an approach via minimal distances

H. Riele, 1978 .

Update 1 to: factorizations of an±1, 13≤a<100

R. Brent, P. L. Montgomery, H. Riele, 1994 .

ON CONSECUTIVE INTEGERS OF THE FORM ax

H. Riele, M. Bennett, 2022 .

On the History of the Function $$ M\left( \chi \right)/\sqrt \chi $$ Since Stieltjes

H. Riele, 1993 .

On solving the Diophantine equation ³+³+³= on a vector computer

W. M. Lioen, Walter M. Lioen, D. R. Heath-Brown, 1993 .

Apportionment in Theory and Practice

Mark Beumer, Herman te Riele, H. Riele, 2010 .

Factorization of a 768-Bit RSA Modulus

Arjen K. Lenstra, Kazumaro Aoki, Pierrick Gaudry, 2010, CRYPTO.

Iteration of number-theoretic functions

H. Riele, 1983 .

FACTORIZATIONS OF a n ± 1, 13 a < 100

Richard P. Brent, R. Brent, H. Riele, 1992 .

Factoring with the quadratic sieve on large vector computers

Dik Winter, Walter M. Lioen, Herman te Riele, 1989 .

Aspects of Computational Science

Nicolai Petkov, Henk Sips, H.J.J. te Riele, 1995 .

Factorization of a 512-Bit RSA Modulus

Jeff Gilchrist, Arjen K. Lenstra, Karen Aardal, 2000, EUROCRYPT.

Factorizations of $ a ^ n $ + 1, 13 < a < 100 : update 2

Robert D. Silverman, R. Brent, P. L. Montgomery, 1996 .