# Ronald C. Mullin

According to our database

Collaborative distances:

^{1}, Ronald C. Mullin authored at least 34 papers between 1975 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2016

Editorial for the 25th anniversary issue.

Des. Codes Cryptogr., 2016

2010

Special issue dedicated to Spyros Magliveras on the occasion of his 70th birthday.

Des. Codes Cryptogr., 2010

2000

Symmetric Graph Designs.

Graphs and Combinatorics, 2000

1997

Orthogonal Double Covers of Complete Graphs by Trees.

Graphs and Combinatorics, 1997

Pairwise Balanced Designs with Consecutive Block Sizes.

Des. Codes Cryptogr., 1997

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

Ars Comb., 1997

1995

On a Problem of Hering Concerning Orthogonal Covers of K

_{n}.
J. Comb. Theory, Ser. A, 1995

Near subgroups of groups.

Discrete Mathematics, 1995

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

Ars Comb., 1995

1994

SIAM J. Discrete Math., 1994

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

J. Comb. Theory, Ser. A, 1994

1993

An Implementation of Elliptic Curve Cryptosystems Over F

_{2155}.
IEEE Journal on Selected Areas in Communications, 1993

Arithmetic Operations in GF(2

^{m}).
J. Cryptology, 1993

Appl. Algebra Eng. Commun. Comput., 1993

1992

On the Development of a Fast Elliptic Curve Cryptosystem.

Proceedings of the Advances in Cryptology, 1992

1991

An Implementation for a Fast Public-Key Cryptosystem.

J. Cryptology, 1991

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

Discrete Mathematics, 1991

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

Discrete Mathematics, 1991

1990

Pairwise balanced designs with odd block sizes exceeding five.

Discrete Mathematics, 1990

1989

Finite bases for some PBD-closed sets.

Discrete Mathematics, 1989

Optimal normal bases in GF(p

^{n}).
Discrete Applied Mathematics, 1989

A Fast Elliptic Curve Cryptosystem.

Proceedings of the Advances in Cryptology, 1989

1988

Covering pairs by quintuples: The case

*v*congruent to 3 (mod 4).
J. Comb. Theory, Ser. A, 1988

Fast Exponentiation in

*GF(2*.^{n})
Proceedings of the Advances in Cryptology, 1988

An Interactive Data Exchange Protocol Based on Discrete Exponentiation.

Proceedings of the Advances in Cryptology, 1988

1987

Coverings of Pairs by Quintuples.

J. Comb. Theory, Ser. A, 1987

Pairwise balanced designs with block sizes 6

*t*+ 1.
Graphs and Combinatorics, 1987

1986

Covering triples by quadruples: An asymptotic solution.

J. Comb. Theory, Ser. A, 1986

1984

Computing Logarithms in GF(2

^{n}).
Proceedings of the Advances in Cryptology, 1984

1983

Finite linear spaces and projective planes.

Discrete Mathematics, 1983

1981

On the existence of frames.

Discrete Mathematics, 1981

1980

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

J. Comb. Theory, Ser. A, 1980

1979

Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems.

J. Comb. Theory, Ser. A, 1979

1975

The mathematical theory of coding.

Acad. Press, ISBN: 0121035506, 1975