• Publications
  • Influence
Latin Squares and Their Applications
Latin Squares and Their Applications Second edition offers a long-awaited update and reissue of this seminal account of the subject. The revision retains foundational, original material from theExpand
  • 675
  • 57
Latin Squares: New Developments in the Theory and Applications
Foreword (P. Erdos). Introduction (J. Denes, A.D. Keedwell). Transversals and Complete Mappings (J. Denes, A.D. Keedwell). Sequenceable and R-Sequenceable Groups: Row Complete Latin Squares (J.Expand
  • 171
  • 10
Crossed-inverse quasigroups with long inverse cycles and applications to cryptography
In this paper, we show that crossed-inverse quasigroups have certain properties which make them particularly appropriate for use in cryptography. In particular, we provide a construction forExpand
  • 29
  • 7
Critical sets and critical partial latin squares
  • 19
  • 3
A new authentication scheme based on latin squares
Abstract We propose a simple and flexible authentication scheme applicable for use with both binary and nonbinary messages and we show that, among the set of all possible messages of assigned length,Expand
  • 28
  • 2
On m-inverse loops and quasigroups with a long inverse cycle
In an earlier paper, we showed that CI-loops and quasigroups with long inverse cycles have certain properties which make them particularly appropriate for use in cryptography. The same is true of theExpand
  • 21
  • 2
On R-Sequenceability and Rh-Sequenceability of Groups
A finite group (G,.) of order n is said to be R-sequenceable (or near-se-quenceable) if its elements a0, a1,…,an-1, can be ordered in such a way that the partial products b0=a0, b1,=a0a1,Expand
  • 14
  • 2
Constructions of complete sets of orthogonal diagonal Sudoku squares
We prove that complete sets of orthogonal diagonal Sudoku latin squares (sometimes called Sudoku frames) exist of all orders p, where p is a prime. We also show that complete sets of orthogonalExpand
  • 12
  • 2
GENERALIZED COMPLETE MAPPINGS, NEOFIELDS, SEQUENCEABLE GROUPS AND BLOCK DESIGNS. II
In part I we introduced the concepts of generalized complete mapping and generalized near complete mapping of a group and used them to characterize left neofields. In §5 of this second part weExpand
  • 36
  • 1