Ronald C. Mullin

Rainer Steinwandt

Des. Codes Cryptogr., 2010

2000

Symmetric Graph Designs.

[BibT_eX]

[DOI]

Alexander Rosa

Paul J. Schellenberg

Graphs Comb., 2000

1997

Orthogonal Double Covers of Complete Graphs by Trees.

[BibT_eX]

[DOI]

Alexander Rosa

Graphs Comb., 1997

Pairwise Balanced Designs with Consecutive Block Sizes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1997

On the Closure of Subsets of {4, 5, ..., 9} which contain {4}.

[BibT_eX]

Ars Comb., 1997

1995

On a Problem of Hering Concerning Orthogonal Covers of Kn.

[BibT_eX]

Andrew Granville

J. Comb. Theory, Ser. A, 1995

Near subgroups of groups.

[BibT_eX]

[DOI]

D. G. Hoffman

Sylvia A. Hobart

Discret. Math., 1995

The closure of all subsets of {3, 4, ...10} which include 3.

[BibT_eX]

Ch. Pietsch

Ars Comb., 1995

1994

Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b.

[BibT_eX]

[DOI]

Shuhong Gao

SIAM J. Discret. Math., 1994

On lambda-Covers of Pairs by Quintuples: v Odd.

[BibT_eX]

W. H. Mills

J. Comb. Theory, Ser. A, 1994

1993

An Implementation of Elliptic Curve Cryptosystems Over F2155.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1993

Arithmetic Operations in GF(2m).

[BibT_eX]

[DOI]

J. Cryptol., 1993

Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4.

[BibT_eX]

[DOI]

Shuhong Gao

Appl. Algebra Eng. Commun. Comput., 1993

1992

On the Development of a Fast Elliptic Curve Cryptosystem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

An Implementation for a Fast Public-Key Cryptosystem.

[BibT_eX]

[DOI]

J. Cryptol., 1991

Singular points in pair covers and their relation to Hadamard designs.

[BibT_eX]

[DOI]

Dan Wevrick

Discret. Math., 1991

The spectrum of alpha-resolvable block designs with block size 3.

[BibT_eX]

[DOI]

Dieter Jungnickel

Discret. Math., 1991

1990

Pairwise balanced designs with odd block sizes exceeding five.

[BibT_eX]

[DOI]

Douglas R. Stinson

Discret. Math., 1990

1989

Finite bases for some PBD-closed sets.

[BibT_eX]

[DOI]

Discret. Math., 1989

Optimal normal bases in GF(pn).

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

A Fast Elliptic Curve Cryptosystem.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1988

Covering pairs by quintuples: The case v congruent to 3 (mod 4).

[BibT_eX]

[DOI]

W. H. Mills

J. Comb. Theory, Ser. A, 1988

Fast Exponentiation in GF(2n).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

An Interactive Data Exchange Protocol Based on Discrete Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1988

1987

Coverings of Pairs by Quintuples.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1987

Pairwise balanced designs with block sizes 6t + 1.

[BibT_eX]

[DOI]

Douglas R. Stinson

Graphs Comb., 1987

1986

Covering triples by quadruples: An asymptotic solution.

[BibT_eX]

[DOI]

Alan Hartman

W. H. Mills

J. Comb. Theory, Ser. A, 1986

1984

Computing Logarithms in GF(2n).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1984

1983

Finite linear spaces and projective planes.

[BibT_eX]

[DOI]

Discret. Math., 1983

1981

On the existence of frames.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

A Generalization of the Singular Direct Product with Applications Skew Room Squares.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1980

1979

Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems.

[BibT_eX]

[DOI]

Charles Curtis Lindner

J. Comb. Theory, Ser. A, 1979

1975

The mathematical theory of coding.

[BibT_eX]

[DOI]