We give details on solving the discrete logarithm problem in the 202-bit prime order subgroup of F2809 using the Function Field Sieve algorithm (FFS). To our knowledge, this computation is theâ€¦ (More)

Journal of clinical oncology : official journalâ€¦

2002

PURPOSE
The prognosis for advanced pancreatic cancer remains poor. Gastrin acts as a growth factor for pancreatic cancer. We describe the first study of the antigastrin immunogen G17DT in pancreaticâ€¦ (More)

The security of most current public-key cryptosystems is based on the difficulty of finding discrete logarithms in large finite fields or factoring large integers. Most discrete logarithm and integerâ€¦ (More)

In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwardsâ€¦ (More)

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of theâ€¦ (More)

This article presents algorithms that convert multiple precision integer or floating-point numbers from radix 2 to radix 10 (or to any radix b > 2). Those algorithms, based on the “scaledâ€¦ (More)