#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1994

2018

- This year (1)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Susan Tweedie, Michael Ashburner, +8 authors Haiyan Zhang
- Nucleic Acids Research
- 2009

FlyBase (http://flybase.org) is a database of Drosophila genetic and genomic information. Gene Ontology (GO) terms are used to describe three attributes of wild-type gene products: their molecularâ€¦ (More)

- Steven J. Marygold, Paul C. Leyland, +4 authors Robert J. Wilson
- Nucleic Acids Research
- 2013

An accurate, comprehensive, non-redundant and up-to-date bibliography is a crucial component of any Model Organism Database (MOD). Principally, the bibliography provides a set of references that areâ€¦ (More)

- Stefania Cavallar, Bruce Dodson, +14 authors Paul Zimmermann
- EUROCRYPT
- 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.

- Derek Atkins, Michael Graff, Arjen K. Lenstra, Paul C. Leyland
- ASIACRYPT
- 1994

We describe the computation which resulted in the title of this paper. Furthermore, we give an analysis of the data collected during this computation. From these data, we derive the importantâ€¦ (More)

- Stefania Cavallar, Bruce Dodson, +6 authors Paul Zimmermann
- ASIACRYPT
- 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â€¦ (More)

- Arjen K. Lenstra, Eran Tromer, +4 authors Paul C. Leyland
- ASIACRYPT
- 2003

We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17] of the TWIRLâ€¦ (More)

We report the factorization of a 135-digit integer by the triple-large-prime variation of the multiple polynomial quadratic sieve. Previous workers [6][10] had suggested that using more than twoâ€¦ (More)

- Thorsten Kleinjung, Joppe W. Bos, +11 authors Heinz Stockinger
- Cluster Computing
- 2010

In December 2009 the 768-bit, 232-digit number RSA-768 was factored using the number field sieve. Overall, the computational challenge would take more than 1700 years on a single, standard core. Inâ€¦ (More)

- M. Pisaroni, Fabio Nobile, Paul C. Leyland
- 2016

In this work we apply the Continuation Multi-Level Monte Carlo (C-MLMC) algorithm proposed by [Collier et al, BIT 2014] to efficiently propagate operational and geometrical uncertainties inâ€¦ (More)

This paper deals with issues related to a cryptanalytic time-memory trade-off (TMTO) attacks on stream ciphers. We describe the basic theory and principles of TMTO attacks and their practicalâ€¦ (More)