#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1994

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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 function, the biological processes in which they play a role, and their subcellular location. This article describes recent changes to the FlyBase GO annotation… (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 specific to the field served by the MOD. Moreover, it serves as a backbone to which all curated biological data can be attributed. Here, we describe the… (More)

- Stefania Cavallar, Bruce Dodson, +14 authors Paul Zimmermann
- EUROCRYPT
- 2000

On August 22, 1999, we completed the factorization of the 512{bit 155{digit number RSA{155 with the help of the Number Field Sieve factoring method (NFS). This is a new record for factoring general numbers. Moreover, 512{bit RSA keys are frequently used for the protection of electronic commerce|at least outside the USA|so this factorization represents a… (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 hardware factoring device [18]. We present the details behind the resulting improved parameter choices from [18].

- 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 previous record was established on April 10, 1996 by the factorization of the 130–digit number RSA–130, also with the help of NFS. The amount of computing time spent… (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 large primes would be counterproductive, because of the greatly increased number of false reports from the sievers. We provide evidence that, for this number and… (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 the article we present the heterogeneous computing approach, involving different compute clusters and Grid computing environments, used to solve this problem.

- Richard P Brent, Peter L Montgomery, +6 authors Thomas Sosnowski
- 1996

This Report updates the tables of factorizations of a n 1 for 13 a < 100, previously published as CWI Report NM-R9212 (June 1992) and updated in CWI Report NM-R9419 (September 1994). A total of 760 new entries in the tables are given here. The factorizations are now complete for n < 67, and there are no composite cofactors smaller than 10 94. Only the front… (More)

- Paul C. Leyland
- Encyclopedia of Cryptography and Security
- 2005