Walter M. Lioen

dblp:01/6023 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2000
0000-0002-3641-9642ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key cryptanalysis
0.012000
Factorization of a 512-Bit RSA Modulus · EUROCRYPT 2000
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key cryptanalysis
RSA factorization
0.012000
Factorization of a 512-Bit RSA Modulus · EUROCRYPT 2000
Cryptographic primitives and cryptanalysis
integer factorization
0.011999
Factorization of RSA-140 Using the Number Field Sieve · ASIACRYPT 1999
Cryptographic primitives and cryptanalysis › integer factorization
number field sieve
0.011999
Factorization of RSA-140 Using the Number Field Sieve · ASIACRYPT 1999
High-performance computing › numerical linear algebra › linear solver › iterative linear solvers
multigrid method
0.011992
Parallelizing a Highly Vectorized Multigrid Code with Zebra Relaxation · SC 1992
High-performance computing
parallel numerical algorithms
0.011992
Parallelizing a Highly Vectorized Multigrid Code with Zebra Relaxation · SC 1992
High-performance computing
scientific computing systems
0.011992
Parallelizing a Highly Vectorized Multigrid Code with Zebra Relaxation · SC 1992
High-performance computing
supercomputing
0.011992
Parallelizing a Highly Vectorized Multigrid Code with Zebra Relaxation · SC 1992

Methods — techniques the papers use, named apart from their topics

number field sieve · 0.1lattice sieving · 0.0zebra relaxation · 0.0autotasking · 0.0
YearPublicationVenuePosition
2000 Factorization of a 512-Bit RSA Modulus
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Karen Aardal, Jeff Gilchrist, Gérard Guillerm, Paul C. Leyland, Joël Marchand, François Morain, Alec Muffett, Chris Putnam, Craig Putnam, Paul Zimmermann 0001
EUROCRYPT4
1999 Factorization of RSA-140 Using the Number Field Sieve
Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul C. Leyland, Walter M. Lioen, Peter L. Montgomery, Brian Murphy, Herman J. J. te Riele, Paul Zimmermann 0001
ASIACRYPT5
1992 Parallelizing a Highly Vectorized Multigrid Code with Zebra Relaxation
abstract
After a brief introduction to multigrid methods, the author discusses some of the algorithmic choices in MGZEB, a parallelized highly vectorized multigrid code for the solution of linear systems resulting from the seven-point discretization of general linear second-order elliptic partial differential equations in two dimensions. He describes the minimization of the scalar operation count, the vector tuning on a vector-register machine, and the parallelization of the already existing highly vectorized MGZEB code. At present the same algorithm would be used with the same scalar operation count on a scalar uniprocessor. The overall parallel vector-performance using autotasking on a Cray Y-MP4/464 is discussed.>
Walter M. Lioen
SC1