Ronald C. Mullin

According to our database1, Ronald C. Mullin authored at least 34 papers between 1975 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

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 Comb., 2000

1997
Orthogonal Double Covers of Complete Graphs by Trees.
Graphs Comb., 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<sub>n</sub>.
J. Comb. Theory, Ser. A, 1995

Near subgroups of groups.
Discret. Math., 1995

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

1994
Normal and Self-dual Normal Bases from Factorization of c x<sup>q+1</sup> + d x<sup>q</sup> - ax - b.
SIAM J. Discret. 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<sub>2<sup>155</sup></sub>.
IEEE J. Sel. Areas Commun., 1993

Arithmetic Operations in GF(2<sup>m</sup>).
J. Cryptol., 1993

Explicit Factorization of x<sup>2<sup>k</sup></sup> + 1 over F<sub>p</sub> with Prime p= 3 mod 4.
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. Cryptol., 1991

Singular points in pair covers and their relation to Hadamard designs.
Discret. Math., 1991

The spectrum of alpha-resolvable block designs with block size 3.
Discret. Math., 1991

1990
Pairwise balanced designs with odd block sizes exceeding five.
Discret. Math., 1990

1989
Finite bases for some PBD-closed sets.
Discret. Math., 1989

Optimal normal bases in GF(p<sup>n</sup>).
Discret. Appl. Math., 1989

A Fast Elliptic Curve Cryptosystem.
Proceedings of the Advances in Cryptology, 1989

1988
Covering pairs by quintuples: The case <i>v</i> congruent to 3 (mod 4).
J. Comb. Theory, Ser. A, 1988

Fast Exponentiation in <i>GF(2<sup>n</sup>)</i>.
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<i>t</i> + 1.
Graphs Comb., 1987

1986
Covering triples by quadruples: An asymptotic solution.
J. Comb. Theory, Ser. A, 1986

1984
Computing Logarithms in GF(2<sup>n</sup>).
Proceedings of the Advances in Cryptology, 1984

1983
Finite linear spaces and projective planes.
Discret. Math., 1983

1981
On the existence of frames.
Discret. Math., 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


  Loading...