Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Latin Squares and Their Applications

- J. Dénes, A. D. Keedwell
- Computer Science
- 1 November 1974

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 the… Expand

Latin Squares: New Developments in the Theory and Applications

- J. Dénes, A. D. Keedwell, G. B. Beli︠a︡vskai︠a︡
- Mathematics
- 7 February 1991

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

Crossed-inverse quasigroups with long inverse cycles and applications to cryptography

- A. D. Keedwell
- Computer Science, Mathematics
- Australas. J Comb.
- 1999

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 for… Expand

A new authentication scheme based on latin squares

- J. Dénes, A. D. Keedwell
- Mathematics, Computer Science
- Discret. Math.
- 1 October 1992

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

On m-inverse loops and quasigroups with a long inverse cycle

- A. D. Keedwell, V. Shcherbacov
- Computer Science, Mathematics
- Australas. J Comb.
- 2002

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 the… Expand

On R-Sequenceability and Rh-Sequenceability of Groups

- A. D. Keedwell
- Mathematics
- 1983

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

Constructions of complete sets of orthogonal diagonal Sudoku squares

- A. D. Keedwell
- Mathematics, Computer Science
- Australas. J Comb.
- 2010

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 orthogonal… Expand

Some applications of non-associative algebraic systems in cryptology

- J. DÃ©nes, A. D. Keedwell
- Computer Science
- 2001

- 17
- 2

GENERALIZED COMPLETE MAPPINGS, NEOFIELDS, SEQUENCEABLE GROUPS AND BLOCK DESIGNS. II

- D. Hsu, A. D. Keedwell
- Mathematics
- 1 April 1984

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 we… Expand