Paul C. Leyland

Learn More
FlyBase ( 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)
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)
On August we completed the factorization of the bit digit number RSA with the help of the Number Field Sieve factoring method NFS This is a new record for factoring general numbers Moreover bit RSA keys are frequently used for the protection of electronic commerce at least outside the USA so this factorization represents a breakthrough in research on RSA(More)
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 observation that in the nal stages the progress of the double large prime variation of the quadratic sieve integer factoring algorithm can more e ectively be approximated(More)
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)
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.
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)