Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Randy Tuler

dblp:82/4072 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Theory of computation · 1

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
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
integer factorization		 0.011988
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm · SIAM J. Comput. 1988
Cryptographic primitives and cryptanalysis › integer factorization
quadratic sieve		 0.011988
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm · SIAM J. Comput. 1988
Hardware accelerators and domain-specific architectures
cryptographic accelerator		 0.011988
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm · SIAM J. Comput. 1988

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

pipeline architecture · 0.0distributed computing · 0.0
YearPublicationVenuePosition
1988 A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm
abstract
We describe the quadratic sieve factoring algorithm and a pipeline architecture on which it could be efficiently implemented. Such a device would be of moderate cost to build and would be able to factor 100-digit numbers in less than a month. This represents an order of magnitude speed-up over current implementations on supercomputers. Using a distributed network of many such devices, it is predicted much larger numbers could be practically factored.
Carl Pomerance, Jeffrey W. Smith, Randy Tuler
 SIAM J. Comput.3