DOCSLIB.ORG

Totally Symmetric and Medial Quasigroups and Their Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Totally Symmetric and Medial Quasigroups and Their Applications TOTALLY SYMMETRIC AND MEDIAL QUASIGROUPS AND THEIR APPLICATIONS by BENJAMIN YOUNG Submitted in partial fulfillment of the requirements for the degree of Master of Science Department of Computing and Information Science CASE WESTERN RESERVE UNIVERSITY May, 2021 CASE WESTERN RESERVE UNIVERSITY SCHOOL OF GRADUATE STUDIES We hereby approve the Thesis of Benjamin Young candidate for the degree of Master of Science*. Committee Chair Dr. Harold Connamacher Committee Member Dr. David Singer Committee Member Dr. Shuai Xu Date of Defense March 25, 2021 *We also certify that written approval has been obtained for any proprietary material contained therein. Contents List of Tables iii List of Figures iv Abstract vi 1 Introduction 1 1.1 Overview . .2 1.2 Basic Definitions . .4 1.3 Totally Symmetric and Medial Quasigroups . .8 1.4 Prior Work Counting Quasigroups . 14 2 n-ary TSM Quasigroups and Trees 17 2.1 n-ary Product Trees . 18 2.2 Generalizing Etherington's Symmetry Results . 22 3 Counting Labeled Binary and n-ary TSM Quasigroups and Abelian Groups 32 3.1 Abelian Groups and Totally Symmetric Medial Quasigroups . 33 3.2 Binary and n-ary Abelian Groups . 40 3.3 Binary and n-ary TSM Quasigroups . 46 3.4 n-ary Abelian Groups and TSM Quasigroups . 51 i 3.5 The Number of Labeled Binary and n-ary TSM Quasigroups and Abelian Groups . 56 4 Applications of Quasigroups 58 4.1 Quasigroups in Cryptology . 59 4.1.1 Survey of Quasigroups in Cryptology . 59 4.1.2 Generating TSM Quasigroups . 66 4.2 TSM Quasigroups and Cubic Curves . 68 4.2.1 The Chord and Tangent Construction . 68 4.2.2 Elliptic Curves and Diffie-Hellman . 74 4.2.3 Iterated Tangents . 76 ii List of Tables 2.1 Demonstrating that τλ1,λ2 = τλ1,µτµ,λ2 τλ1,µ................ 28 3.1 Number of labeled TSM quasigroups versus number of all labeled quasi- groups over k elements . 57 4.1 Example of Vigen`erecipher . 60 iii List of Figures 1.1 Cayley table of integers mod 3 . .4 1.2 Demonstrating ab = ba in a totally symmetric quasigroup . .9 1.3 Demonstrating a(ab) = b in a totally symmetric quasigroup . 10 1.4 Demonstrating (ab)(bc) = (ac)(bd) in a medial quasigroup . 10 1.5 Example of equation tree . 12 1.6 Diagram of bijections between binary and n-ary TSM quasigroups and abelian groups . 14 2.1 Example of n-ary product tree . 19 2.2 Example of a full tree . 19 2.3 Product tree illustrating the induction step in Theorem 2 . 24 2.4 Product tree after swapping sij and sk1 ................. 25 0 2.5 Product tree after swapping u and v and sij with sk1 ......... 26 n n−1 n−1 2.6 Product tree for f f f(x1 ); y1 ; z1 ................ 28 n 2.7 Equation tree for f(s1 ) = x ....................... 29 n n 2.8 Equation tree for f(s1 ) = f(t1 )..................... 30 i0−1 n n 2.9 Equation tree for f s1 ; f(t1 ); si0+1 = si0 ............... 30 3.1 Diagram of bijections between binary and n-ary TSM quasigroups and abelian groups . 33 3.2 Bijection between TSM quasigroups and abelian groups . 34 iv 3.3 Bijection between binary and n-ary abelian groups . 40 3.4 Bijection between binary and n-ary TSM quasigroups . 46 n−2 n−1 n−1 3.5 Product tree for f 0 ; gn; f 0 ; f(0; g1 ) ............ 47 n−3 n−2 n−1 3.6 Product tree for h 0 ; gn; h 0 ; h(g1 ) ............. 48 3.7 Bijection between n-ary TSM quasigroups and n-ary abelian groups . 51 4.1 The tabula recta . 60 4.2 Example of chord and tangent multiplication on a cubic curve . 70 4.3 Example of mediality on a cubic curve . 72 v Totally Symmetric and Medial Quasigroups and their Applications Abstract by BENJAMIN YOUNG We prove some new results regarding binary and n-ary totally symmetric and medial (TSM) quasigroups and explore their applications to cubic curves and cryptography. We first generalize to the n-ary case Etherington's result that a product in binary TSM quasigroup is symmetric in factors whose depths differ by a multiple of 2 in the corresponding product tree. We then demonstrate that there are an equal number of the four following labeled structures over any finite set: abelian groups, n-ary abelian groups, TSM quasigroups, and n-ary TSM quasigroups. Next we explore applications of quasigroups in cryptography and discuss how our maps between abelian groups, TSM quasigroups, and n-ary TSM quasigroups can be used to generate and easily calculate products in quasigroups for use in cryptosystems. Finally, we discuss the TSM quasigroup of points on a cubic curve and prove some properties of iterated squaring in prime-order TSM quasigroups. vi Chapter 1 Introduction 1 1.1 Overview In this thesis we prove several new results about binary and n-ary totally symmetric and medial (TSM) quasigroups and discuss these results' implications in two primary applications of quasigroups: cryptology and cubic curves. We begin Chapter 1 by presenting definitions of TSM quasigroups, abelian groups, and the n-ary variants of both. We also introduce the concept of product trees for binary groupoids. In Section 1.4, as a preface to our work in Chapter 3, we review prior work counting quasigroups and n-ary quasigroups. In Chapter 2, generalizing a result from Ether- ington, we prove that a product in an n-ary TSM quasigroup is symmetric in factors whose depths in the product's tree representation differ by a multiple of 2 - that is, we can permute those factors without changing the value of the product. In Chapter 3 we demonstrate that there are an equal number of the four fol- lowing labeled structures over any finite set: abelian groups, n-ary abelian groups, TSM quasigroups, and n-ary TSM quasigroups. Each of Chapter 3's sections focuses on finding a bijection between two sets of algebraic constructions over a finite set G. Three of these bijections were unknown prior to this thesis. In Section 3.1 we demonstrate several bijections between the sets of binary abelian groups and binary TSM quasigroups. In Section 3.2 we give a bijection from the set of binary abelian groups to the set of n-ary abelian groups for any n. In Section 3.3 we use the theory developed in Chapter 2 to reproduce Hacker's proof of a bijection between (n−1)-ary and n-ary TSM quasigroups for every n ≥ 3, giving a bijection between binary TSM quasigroups and n-ary TSM quasigroups for any n. Finally in Section 3.4 we use the results of the previous sections to derive a bijection between n-ary abelian groups and n-ary TSM quasigroups. In Chapter 4 we discuss the significance of our results to two areas of applications of TSM quasigroups. In Section 4.1 we review previous applications of quasigroups to cryptology. We discuss how the maps between abelian groups, TSM quasigroups, and 2 n-ary TSM quasigroups discussed in Chapter 3 let us easily generate binary and n- ary TSM quasigroups for use in cryptosystems, and let us calculate products in those quasigroups without having to store their Cayley tables. In Section 4.2 we define cubic plane curves and relay Etherington's proof that the points on a cubic plane curve form a TSM quasigroup under the chord and tangent construction. Finally, we discuss elliptic curve cryptography and the Diffie-Hellman key exchange, prove some results about iterated squaring in a prime-order TSM quasigroup, or equivalently iterated tangents in a cubic curve, and discuss the merits of iterated squaring as a possible operation for a Diffie-Hellman variant. 3 1.2 Basic Definitions Let G be a set with n elements, which we will usually denote by 0; 1; : : : ; n − 1. If f is any operation that takes elements of G as arguments and returns an element of G, write (G; f) to mean G equipped with the operation f. If f : Gn = G × G × ::: × G ! G | {z } n (f takes a list of n elements on G and returns an element of G), we say f is an n-ary operation. We usually denote 2-ary (binary) operations by symbols - typically +; ·; ∗, or ◦ - and frequently leave out the · and write a · b = ab. We denote n-ary operations for n > 3 as letters and use function notation, for example f(a; b; c). If (G; ·) is a set equipped with a binary operation (a magma), then the Cayley Table of (G; ·) is analogous to its multiplication table. For example, if G = f0; 1; 2g and a +3 b := a + b mod 3 then (G; +3) has the following Cayley table: 0 1 2 0 0 1 2 1 1 2 0 2 2 0 1 Figure 1.1: Cayley table of (G; +3) (G; ·) is a quasigroup if for any a; b 2 G, the equations a · x = b and y · a = b have unique solutions for x and y, respectively. The former means that if we are searching for a b in row a of (G; ·)'s Cayley table, we will find it exactly once: in column x. Similarly, the latter means that if we are searching for a b in column a we will find it exactly once: in row y. Thus every row and every column of (G; ·)'s Cayley table is a permutation of the elements of G. In other words, the Cayley table of any quasigroup (G; ·) is a Latin square.
Load more

Recommended publications
  • Complex Algebras of Semigroups Pamela Jo Reich Iowa State University
    Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1996 Complex algebras of semigroups Pamela Jo Reich Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Mathematics Commons Recommended Citation Reich, Pamela Jo, "Complex algebras of semigroups " (1996). Retrospective Theses and Dissertations. 11765. https://lib.dr.iastate.edu/rtd/11765 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. INFORMATION TO USERS This manuscript has been reproduced from the microfihn master. UMI fibns the text du-ectly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproductioii is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and unproper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., m^s, drawings, charts) are reproduced by sectioning the original, beginning at the upper left-hand comer and continuing from left to right in equal sections with small overiaps.
    [Show full text]
  • On Free Quasigroups and Quasigroup Representations Stefanie Grace Wang Iowa State University
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2017 On free quasigroups and quasigroup representations Stefanie Grace Wang Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Mathematics Commons Recommended Citation Wang, Stefanie Grace, "On free quasigroups and quasigroup representations" (2017). Graduate Theses and Dissertations. 16298. https://lib.dr.iastate.edu/etd/16298 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. On free quasigroups and quasigroup representations by Stefanie Grace Wang A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Jonathan D.H. Smith, Major Professor Jonas Hartwig Justin Peters Yiu Tung Poon Paul Sacks The student author and the program of study committee are solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2017 Copyright c Stefanie Grace Wang, 2017. All rights reserved. ii DEDICATION I would like to dedicate this dissertation to the Integral Liberal Arts Program. The Program changed my life, and I am forever grateful. It is as Aristotle said, \All men by nature desire to know." And Montaigne was certainly correct as well when he said, \There is a plague on Man: his opinion that he knows something." iii TABLE OF CONTENTS LIST OF TABLES .
    [Show full text]
  • Quasigroup Identities and Mendelsohn Designs
    Can. J. Math., Vol. XLI, No. 2, 1989, pp. 341-368 QUASIGROUP IDENTITIES AND MENDELSOHN DESIGNS F. E. BENNETT 1. Introduction. A quasigroup is an ordered pair (g, •), where Q is a set and (•) is a binary operation on Q such that the equations ax — b and ya — b are uniquely solvable for every pair of elements a,b in Q. It is well-known (see, for example, [11]) that the multiplication table of a quasigroup defines a Latin square, that is, a Latin square can be viewed as the multiplication table of a quasigroup with the headline and sideline removed. We are concerned mainly with finite quasigroups in this paper. A quasigroup (<2, •) is called idempotent if the identity x2 = x holds for all x in Q. The spectrum of the two-variable quasigroup identity u(x,y) = v(x,y) is the set of all integers n such that there exists a quasigroup of order n satisfying the identity u(x,y) = v(x,y). It is particularly useful to study the spectrum of certain two-variable quasigroup identities, since such identities are quite often instrumental in the construction or algebraic description of combinatorial designs (see, for example, [1, 22] for a brief survey). If 02? ®) is a quasigroup, we may define on the set Q six binary operations ®(1,2,3),<8)(1,3,2),®(2,1,3),®(2,3,1),(8)(3,1,2), and 0(3,2,1) as follows: a (g) b = c if and only if a <g> (1,2, 3)b = c,a® (1, 3,2)c = 6, b ® (2,1,3)a = c, ft <g> (2,3, l)c = a, c ® (3,1,2)a = ft, c ® (3,2, \)b = a.
    [Show full text]
  • Group Isomorphisms MME 529 Worksheet for May 23, 2017 William J
    Group Isomorphisms MME 529 Worksheet for May 23, 2017 William J. Martin, WPI Goal: Illustrate the power of abstraction by seeing how groups arising in different contexts are really the same. There are many different kinds of groups, arising in a dizzying variety of contexts. Even on this worksheet, there are too many groups for any one of us to absorb. But, with different teams exploring different examples, we should { as a class { discover some justification for the study of groups in the abstract. The Integers Modulo n: With John Goulet, you explored the additive structure of Zn. Write down the addition table for Z5 and Z6. These groups are called cyclic groups: they are generated by a single element, the element 1, in this case. That means that every element can be found by adding 1 to itself an appropriate number of times. The Group of Units Modulo n: Now when we look at Zn using multiplication as our operation, we no longer have a group. (Why not?) The group U(n) = fa 2 Zn j gcd(a; n) = 1g ∗ is sometimes written Zn and is called the group of units modulo n. An element in a number system (or ring) is a \unit" if it has a multiplicative inverse. Write down the multiplication tables for U(6), U(7), U(8) and U(12). The Group of Rotations of a Regular n-Gon: Imagine a regular polygon with n sides centered at the origin O. Let e denote the identity transformation, which leaves the poly- gon entirely fixed and let a denote a rotation about O in the counterclockwise direction by exactly 360=n degrees (2π=n radians).
    [Show full text]
  • Right Product Quasigroups and Loops
    RIGHT PRODUCT QUASIGROUPS AND LOOPS MICHAEL K. KINYON, ALEKSANDAR KRAPEZˇ∗, AND J. D. PHILLIPS Abstract. Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which left translations are bijective). If we do not assume associativity we get right quasigroups which are not necessarily representable as direct products of right zero semigroups and quasigroups. To obtain such a representation, we need stronger assumptions which lead us to the notion of right product quasigroup. If the quasigroup component is a (one-sided) loop, then we have a right product (left, right) loop. We find a system of identities which axiomatizes right product quasigroups, and use this to find axiom systems for right product (left, right) loops; in fact, we can obtain each of the latter by adjoining just one appropriate axiom to the right product quasigroup axiom system. We derive other properties of right product quasigroups and loops, and conclude by show- ing that the axioms for right product quasigroups are independent. 1. Introduction In the semigroup literature (e.g., [1]), the most commonly used definition of right group is a semigroup (S; ·) which is right simple (i.e., has no proper right ideals) and left cancellative (i.e., xy = xz =) y = z). The structure of right groups is clarified by the following well-known representation theorem (see [1]): Theorem 1.1. A semigroup (S; ·) is a right group if and only if it is isomorphic to a direct product of a group and a right zero semigroup.
    [Show full text]
  • Arxiv:2001.06557V1 [Math.GR] 17 Jan 2020 Magic Cayley-Sudoku Tables
    Magic Cayley-Sudoku Tables∗ Rosanna Mersereau Michael B. Ward Columbus, OH Western Oregon University 1 Introduction Inspired by the popularity of sudoku puzzles along with the well-known fact that the body of the Cayley table1 of any finite group already has 2/3 of the properties of a sudoku table in that each element appears exactly once in each row and in each column, Carmichael, Schloeman, and Ward [1] in- troduced Cayley-sudoku tables. A Cayley-sudoku table of a finite group G is a Cayley table for G the body of which is partitioned into uniformly sized rectangular blocks, in such a way that each group element appears exactly once in each block. For example, Table 1 is a Cayley-sudoku ta- ble for Z9 := {0, 1, 2, 3, 4, 5, 6, 7, 8} under addition mod 9 and Table 3 is a Cayley-sudoku table for Z3 × Z3 where the operation is componentwise ad- dition mod 3 (and ordered pairs (a, b) are abbreviated ab). In each case, we see that we have a Cayley table of the group partitioned into 3 × 3 blocks that contain each group element exactly once. Lorch and Weld [3] defined a modular magic sudoku table as an ordinary sudoku table (with 0 in place of the usual 9) in which the row, column, arXiv:2001.06557v1 [math.GR] 17 Jan 2020 diagonal, and antidiagonal sums in each 3 × 3 block in the table are zero mod 9. “Magic” refers, of course, to magic Latin squares which have a rich history dating to ancient times.
    [Show full text]
  • The Characteristics of Some Kinds of Special Quasirings *
    ISSN 1746-7659, England, UK Journal of Information and Computing Science Vol. 1, No. 5, 2006, pp. 295-302 The Characteristics of Some Kinds of Special Quasirings * Ping Zhu1, Jinhui Pang 2, Xu-qing Tang3 1 School of Science, Southern Yangtze University, Wuxi, Jiangsu 214122, P. R. China + 2 School of Management & Economics, Beijing Institute Of Technology, Beijing, 100081, P. R. China 3 Key Laboratory of Intelligent Computing &Signal Processing of Ministry of Education, Anhui University, Hefei, 230039, P. R. China ( Received July 02, 2006, Accepted September 11, 2006 ) Abstract. By using quasi-group, we introduce some kinds of special quasi-rings and discuss their characteristics. According to the concept of monogenic semigroup we introduce definition of monogenic semiring and discuss the numbers and structures of monogenic semiring .Then we display their relations as following: Ø {integral domain }(∉ { strong biquasiring }) {}division ring Ø {}({int})strong biquasiring∉ egral domain Ø {}ring ØØØ{}biquasiring {}{} quasiring semiring Ø {}monogenic semiring Keywords: Semiring, Quasiring, Biquasiring, Strong Biquasiring, Monogenic Semiring AMS: Subject Classification (2000): 20M07, 20M10 1. Introduction A semiring[1] S = (S,+,•) is an algebra where both the additive reduct (S,+) and the multiplicative reduct (S,•) are semigroups and such that the following distributive laws hold: x( y + z) = xy + xz, (x + y)z = xz + yz . A semiring (,,)S + • is called a nilsemiring if there are additive idempotent 0 and for any a∈S ,there are n∈N , such that na = 0 . An ideal (prime ideal) of a semiring (S,+,•) is the ideal (prime ideal) of the (S,•). An ideal I of a semiring S is called a K-ideal[1], if ∀a,b ∈ S, a ∈ I and (a + b ∈ I or b + a ∈ I ) ⇒ b ∈ I .
    [Show full text]
  • A Guide to Self-Distributive Quasigroups, Or Latin Quandles
    A GUIDE TO SELF-DISTRIBUTIVE QUASIGROUPS, OR LATIN QUANDLES DAVID STANOVSKY´ Abstract. We present an overview of the theory of self-distributive quasigroups, both in the two- sided and one-sided cases, and relate the older results to the modern theory of quandles, to which self-distributive quasigroups are a special case. Most attention is paid to the representation results (loop isotopy, linear representation, homogeneous representation), as the main tool to investigate self-distributive quasigroups. 1. Introduction 1.1. The origins of self-distributivity. Self-distributivity is such a natural concept: given a binary operation on a set A, fix one parameter, say the left one, and consider the mappings ∗ La(x) = a x, called left translations. If all such mappings are endomorphisms of the algebraic structure (A,∗ ), the operation is called left self-distributive (the prefix self- is usually omitted). Equationally,∗ the property says a (x y) = (a x) (a y) ∗ ∗ ∗ ∗ ∗ for every a, x, y A, and we see that distributes over itself. Self-distributivity∈ was pinpointed already∗ in the late 19th century works of logicians Peirce and Schr¨oder [69, 76], and ever since, it keeps appearing in a natural way throughout mathematics, perhaps most notably in low dimensional topology (knot and braid invariants) [12, 15, 63], in the theory of symmetric spaces [57] and in set theory (Laver’s groupoids of elementary embeddings) [15]. Recently, Moskovich expressed an interesting statement on his blog [60] that while associativity caters to the classical world of space and time, distributivity is, perhaps, the setting for the emerging world of information.
    [Show full text]
  • Semilattice Sums of Algebras and Mal'tsev Products of Varieties
    Mathematics Publications Mathematics 5-20-2020 Semilattice sums of algebras and Mal’tsev products of varieties Clifford Bergman Iowa State University, [email protected] T. Penza Warsaw University of Technology A. B. Romanowska Warsaw University of Technology Follow this and additional works at: https://lib.dr.iastate.edu/math_pubs Part of the Algebra Commons The complete bibliographic information for this item can be found at https://lib.dr.iastate.edu/ math_pubs/215. For information on how to cite this item, please visit http://lib.dr.iastate.edu/ howtocite.html. This Article is brought to you for free and open access by the Mathematics at Iowa State University Digital Repository. It has been accepted for inclusion in Mathematics Publications by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Semilattice sums of algebras and Mal’tsev products of varieties Abstract The Mal’tsev product of two varieties of similar algebras is always a quasivariety. We consider when this quasivariety is a variety. The main result shows that if V is a strongly irregular variety with no nullary operations, and S is a variety, of the same type as V, equivalent to the variety of semilattices, then the Mal’tsev product V ◦ S is a variety. It consists precisely of semilattice sums of algebras in V. We derive an equational basis for the product from an equational basis for V. However, if V is a regular variety, then the Mal’tsev product may not be a variety. We discuss examples of various applications of the main result, and examine some detailed representations of algebras in V ◦ S.
    [Show full text]
  • Mathematica Balkanica ————————— Analysis of Some Quasigroup Transformations As Boolean Functions Aleksandra Mi
    Mathematica B a l k a n i c a ||||||||| New Series Vol. 26, 2012, Fasc. 3{4 Analysis of Some Quasigroup Transformations as Boolean Functions Aleksandra Mileva Presented at MASSEE International Conference on Mathematics MICOM-2009 Two kind of attacks on cryptographic primitives - the linear and the differential crypt- analysis, have been occupied the attention of the cryptographic community since several years ago. Every cryptographic primitive can be examined as a vector valued Boolean function. The prop ratio tables and the correlation matrices are important tools for analyzing the resistance of any Boolean function to the linear and the differential cryptanalysis. There are several cryptographic primitives based on the so called quasigroup transformations, and in this paper we analyze these quasigroup transformations as Boolean functions. We examine correlation matrices, prop ratio tables and some other cryptographic properties. MSC 2010: 94A60, 20N05, 11T71. Key Words: vector valued Boolean function, prop ratio tables, correlation matrices, quasigroup transformations. 1. Introduction Most of the known constructions of cryptographic primitives use struc- tures from the associative algebras as groups, rings and fields. Two eminent specialists on quasigroups, J. D´enesand A. D. Keedwell [5], once proclaimed the advent of a new era in cryptology, consisting in the application of non- associative algebraic systems as quasigroups and neo-fields. In the past few years, cryptographic community have been introduced with several complete quasigroup based cryptographic primitives (complete in the sense of software and/or hardware implementations, security analysis and proofs and external cryptanalysis), as the binary additive stream cipher Edon80 [6], which is one of the few left unbroken eSTREAM finalists; two Round 1 candidate hash func- tions of NIST SHA-3 competition: Edon-R [7] and NaSHA [10]; etc.
    [Show full text]
  • Cosets and Cayley-Sudoku Tables
    Cosets and Cayley-Sudoku Tables Jennifer Carmichael Chemeketa Community College Salem, OR 97309 [email protected] Keith Schloeman Oregon State University Corvallis, OR 97331 [email protected] Michael B. Ward Western Oregon University Monmouth, OR 97361 [email protected] The wildly popular Sudoku puzzles [2] are 9 £ 9 arrays divided into nine 3 £ 3 sub-arrays or blocks. Digits 1 through 9 appear in some of the entries. Other entries are blank. The goal is to ¯ll the blank entries with the digits 1 through 9 in such a way that each digit appears exactly once in each row and in each column, and in each block. Table 1 gives an example of a completed Sudoku puzzle. One proves in introductory group theory that every element of any group appears exactly once in each row and once in each column of the group's op- eration or Cayley table. (In other words, any Cayley table is a Latin square.) Thus, every Cayley table has two-thirds of the properties of a Sudoku table; only the subdivision of the table into blocks that contain each element ex- actly once is in doubt. A question naturally leaps to mind: When and how can a Cayley table be arranged in such a way as to satisfy the additional requirements of being a Sudoku table? To be more speci¯c, group elements labeling the rows and the columns of a Cayley table may be arranged in any order. Moreover, in de¯ance of convention, row labels and column labels need not be in the same order.
    [Show full text]
  • The Quasigroup Block Cipher and Its Analysis Matthew .J Battey University of Nebraska at Omaha
    University of Nebraska at Omaha DigitalCommons@UNO Student Work 5-2014 The Quasigroup Block Cipher and its Analysis Matthew .J Battey University of Nebraska at Omaha Follow this and additional works at: https://digitalcommons.unomaha.edu/studentwork Part of the Computer Sciences Commons Recommended Citation Battey, Matthew J., "The Quasigroup Block Cipher and its Analysis" (2014). Student Work. 2892. https://digitalcommons.unomaha.edu/studentwork/2892 This Thesis is brought to you for free and open access by DigitalCommons@UNO. It has been accepted for inclusion in Student Work by an authorized administrator of DigitalCommons@UNO. For more information, please contact [email protected]. The Quasigroup Block Cipher and its Analysis A Thesis Presented to the Department of Computer Sience and the Faculty of the Graduate College University of Nebraska In partial satisfaction of the requirements for the degree of Masters of Science by Matthew J. Battey May, 2014 Supervisory Committee: Abhishek Parakh, Co-Chair Haifeng Guo, Co-Chair Kenneth Dick Qiuming Zhu UMI Number: 1554776 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. UMI 1554776 Published by ProQuest LLC (2014). Copyright in the Dissertation held by the Author. Microform Edition © ProQuest LLC. All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code ProQuest LLC. 789 East Eisenhower Parkway P.O.
    [Show full text]