#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1981

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

Learn More

- Daniel M. Gordon
- SIAM J. Discrete Math.
- 1993

Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c], where Ln[v; c] = exp{(c + o(1))(log n) (log log n)}, for n â†’ âˆž. Inâ€¦ (More)

- Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson
- EUROCRYPT
- 1992

In several crypt,ographic systems, a fixed elcment g of a group (generally z/qz) is repeatedly raised to many different powers. In this paper we present a practical method of speeding u p suchâ€¦ (More)

A (v, k, t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is theâ€¦ (More)

- Daniel M. Gordon
- IEEE Trans. Information Theory
- 1982

- Lone Simonsen, Daniel M. Gordon, F. M. Stewart, Bruce R. Levin
- Journal of general microbiology
- 1990

We describe a method for determining the rate parameter of conjugative plasmid transfer that is based on single estimates of donor, recipient and transconjugant densities and the growth rate inâ€¦ (More)

- Daniel M. Gordon
- 1992

We derive the equations necessary to perform a two-descent on the Jacobians of curves of genus two with rational Weierstrass points. We compute the Mordell-Weil rank of the Jacobian of some genus twoâ€¦ (More)

- Daniel M. Gordon, Kevin S. McCurley
- CRYPTO
- 1992

Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the sizeâ€¦ (More)

- Daniel M. Gordon
- CRYPTO
- 1992

Using a number field sieve, discrete logarithms modulo primes of special forms can be found faster than standard primes. This has raised concerns about trapdoors in discrete log cryptosystems, suchâ€¦ (More)

- Daniel M. Gordon
- 1988

Letpc{d) be the critical probability for percolation in Z . It is shown that lim,, _, ro 2dpc(d) = 1. The proof uses the properties of a random subgraph of an m-ary d-dimensional cube. If each edgeâ€¦ (More)

- Daniel M. Gordon
- Journal of general microbiology
- 1992

The conjugative plasmid R1 was introduced into ten strains of Escherichia coli isolated from natural populations. Spontaneous nalidixic-acid-resistant mutants of the ten strains served as recipients.â€¦ (More)