Elements of quasigroup theory and some its applications in code theory and cryptology

[1]  Alexander S. Ecker,et al.  Check character systems , 1986, Computing.

[2]  Ales Drápal.  How far apart can the group multiplication tables be? , 1992, Eur. J. Comb..

[3]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[4]  Ales Drápal.  Hamming distances of groups and quasi-groups , 2001, Discret. Math..

[5]  A Drápal.  Groups St Andrews 1997 in Bath, I: On distances of multiplication tables of groups , 1999 .

[6]  Paul M. Weichsel,et al.  A first course in abstract algebra , 1966 .

[7]  Antonio Maturo,et al.  Rédei blocking sets with two Rédei lines and quasigroups , 2002 .

[8]  L. Mittenthal,et al.  Block Substitutions Using Orthomorphic Mappings , 1995 .

[9]  Gary L. Mullen,et al.  Check Character Systems using Quasigroups: I , 2005, Des. Codes Cryptogr..

[10]  D. Frank Hsu,et al.  Cyclic Neofields and Combinatorial Designs , 1980 .

[11]  G. Mullen,et al.  Discrete Mathematics Using Latin Squares , 1998, The Mathematical Gazette.

[12]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[13]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[14]  J. Dénes.  On Latin squares and a digital encrypting communication system , 2000 .

[15]  Ralph-Hardo Schulz,et al.  Check Character Systems and Anti-symmetric Mappings , 2001, Computational Discrete Mathematics.

[16]  Anne Penfold Street,et al.  Steiner Trades That Give Rise To Completely Decomposable Latin Interchanges , 2002, Int. J. Comput. Math..

[17]  Yu. M. Movsisyan.  Hyperidentities in algebras and varieties , 1998 .

[18]  D. Kahn.  The codebreakers : the story of secret writing , 1968 .

[19]  James Osborn,et al.  Loops with the weak inverse property. , 1960 .

[20]  Desmond Fearnley-Sander,et al.  Universal Algebra , 1982 .

[21]  Reinhold Baer.  Nets and groups. II , 1940 .

[22]  Henry Beker,et al.  Cipher Systems: The Protection of Communications , 1982 .

[23]  Andrei V. Kelarev.  MR2004g:94108, Properties of codes with one check symbol from a quasigroup point of view , 2004 .

[24]  Wolfgang Tittel,et al.  Practical Aspects of Quantum Cryptographic Key Distribution , 2000, Journal of Cryptology.

[25]  H. O. Pflugfelder.  Quasigroups and loops : introduction , 1990 .

[26]  R. Baer.  Nets and groups , 1939 .

[27]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[28]  Diane Donovan.  Critical sets in Latin squares of order less than 11 , 1999 .

[29]  Jennifer Seberry,et al.  Encryption methods based on combinatorial designs , 1986 .

[30]  Douglas R. Stinson,et al.  New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups , 2001, Journal of Cryptology.

[31]  Ales Drápal.  On Groups that Differ in One of Four Squares , 2002, Eur. J. Comb..

[32]  Natalia Zhukavets,et al.  ON MULTIPLICATION TABLES OF GROUPS THAT AGREE ON HALF OF THE COLUMNS AND HALF OF THE ROWS , 2003, Glasgow Mathematical Journal.

[33]  Gary L. Mullen,et al.  A Quasigroup-Based Public-Key Cryptosystem , 1999 .

[34]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[35]  S. A. Huggett,et al.  The geometric universe : science, geometry, and the work of Roger Penrose , 1998 .

[36]  Spectrum of partial admissibility of finite quasigroups (latin squares) , 1982 .

[37]  J. Seberry,et al.  Secret sharing schemes arising from latin squares , 1994 .

[38]  A. D. Keedwell,et al.  Latin Squares: New Developments in the Theory and Applications , 1991 .

[39]  Antonio Maturo,et al.  A New Authentication System Based on the Generalized Affine Planes , 1992 .

[40]  Aleš Drápal.  Non-isomorphic 2-groups Coincide at Most in Three Quarters of their Multiplication Tables , 2000, Eur. J. Comb..

[41]  Nonlinear shift registers that produce all vectors of weight , 1992 .

[42]  Grace E. Bates,et al.  A note on homomorphic mappings of quasigroups into multiplicative systems , 1948 .

[43]  L. Mittenthal.  A Source of Cryptographically Strong Permutations for Use in Block Ciphers , 1993, Proceedings. IEEE International Symposium on Information Theory.

[44]  R. Artzy,et al.  Crossed-inverse and related loops , 1959 .

[45]  A. D. Keedwell,et al.  Some applications of non-associative algebraic systems in cryptology , 2001 .

[46]  Jonas Gloeckner,et al.  Groups St Andrews 1997 In Bath , 1997 .

[47]  A. Donald Keedwell,et al.  Crossed-inverse quasigroups with long inverse cycles and applications to cryptography , 1999, Australas. J Comb..

[48]  Jacobus Verhoeff,et al.  Error detecting decimal codes , 1969 .

[49]  Diane Donovan.  Critical sets for families of Latin squares , 1998 .

[50]  Czesław Kościelny.  Generating quasigroups for cryptographic applications , 2002 .

[51]  Diane Donovan,et al.  Towards the spectrum of critical sets , 2000, Australas. J Comb..