On some Constructions of Shapeless Quasigroups



Similar documents
arxiv: v1 [cs.cr] 15 Oct 2010

(Q, ), (R, ), (C, ), where the star means without 0, (Q +, ), (R +, ), where the plus-sign means just positive numbers, and (U, ),

Groups in Cryptography

2.3. Finding polynomial functions. An Introduction:

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur

Cryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur

Table of Contents. Bibliografische Informationen digitalisiert durch

CIS 6930 Emerging Topics in Network Security. Topic 2. Network Security Primitives

Lukasz Pater CMMS Administrator and Developer

A NOVEL STRATEGY TO PROVIDE SECURE CHANNEL OVER WIRELESS TO WIRE COMMUNICATION

EXAM questions for the course TTM Information Security May Part 1

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Overview of Cryptographic Tools for Data Security. Murat Kantarcioglu

On the Influence of the Algebraic Degree of the Algebraic Degree of

Network Security Technology Network Management

Cryptography and Network Security Chapter 3

Secret File Sharing Techniques using AES algorithm. C. Navya Latha Garima Agarwal Anila Kumar GVN

Finite dimensional C -algebras

CS 758: Cryptography / Network Security

Cryptography and Network Security

A NEW HASH ALGORITHM: Khichidi-1

A Factoring and Discrete Logarithm based Cryptosystem

Outline. Computer Science 418. Digital Signatures: Observations. Digital Signatures: Definition. Definition 1 (Digital signature) Digital Signatures

CSC474/574 - Information Systems Security: Homework1 Solutions Sketch

ss. Cyril and Methodius University Faculty of Computer Science and Engineering Skopje, Macedonia

1 Introduction to Matrices

Textbooks: Matt Bishop, Introduction to Computer Security, Addison-Wesley, November 5, 2004, ISBN

Abstract Algebra Cheat Sheet

Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Prof. Jadranka Dabovic - Anastasovska, PhD Ass. Neda Zdraveva, MSci. Faculty of Law Iustinianus Primus Skopje

Lecture 9: Application of Cryptography

Network Security: Cryptography CS/SS G513 S.K. Sahay

INFORMATION SECURITY A MULTIDISCIPLINARY. Stig F. Mjolsnes INTRODUCTION TO. Norwegian University ofscience & Technology. CRC Press

VALLIAMMAI ENGINEERING COLLEGE

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Solutions to Problem Set 1

Elements of Abstract Group Theory

Group Theory. Contents

Modern Block Cipher Standards (AES) Debdeep Mukhopadhyay

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

Computer Security: Principles and Practice

Public Key Cryptography and RSA. Review: Number Theory Basics

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

CIS433/533 - Computer and Network Security Cryptography

Chapter 7: Products and quotients

Network Security. Gaurav Naik Gus Anderson. College of Engineering. Drexel University, Philadelphia, PA. Drexel University. College of Engineering

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Lecture 4 Data Encryption Standard (DES)

Cryptography and Network Security, PART IV: Reviews, Patches, and Theory 1 / 53

GROUPS ACTING ON A SET

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10

Elliptic Curve Cryptography

SECURITY IMPROVMENTS TO THE DIFFIE-HELLMAN SCHEMES

Talk announcement please consider attending!

The Advanced Encryption Standard: Four Years On

Implementation of Elliptic Curve Digital Signature Algorithm

Network Security. Chapter 2 Basics 2.1 Symmetric Cryptography. Cryptographic algorithms: outline. Basic Terms: Block cipher and Stream cipher

Software implementation of the geodatabase model of the Republic of Macedonia

FAREY FRACTION BASED VECTOR PROCESSING FOR SECURE DATA TRANSMISSION

The Stream Cipher HC-128

LUC: A New Public Key System

Index Calculation Attacks on RSA Signature and Encryption

Implementing Network Security Protocols

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

Lesson 9: Radicals and Conjugates

Lecture 13 - Basic Number Theory.

CrypTool Claudia Eckert / Thorsten Clausius Bernd Esslinger / Jörg Schneider / Henrik Koy

minimal polyonomial Example

CRYPTOGRAPHY AND NETWORK SECURITY

NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES

Digital Signature For Text File

Cryptography and Network Security Block Cipher

Lecture 9 - Message Authentication Codes

COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

6. Cholesky factorization

1 A duality between descents and connectivity.

Network Security. A Quick Overview. Joshua Hill josh-web@untruth.org

ECE 428 Network Security

3 1. Note that all cubes solve it; therefore, there are no more

Chapter 7. Permutation Groups

Lecture 1: Introduction. CS 6903: Modern Cryptography Spring Nitesh Saxena Polytechnic University

NOTES ON GROUP THEORY


Cryptosystems. Bob wants to send a message M to Alice. Symmetric ciphers: Bob and Alice both share a secret key, K.

How To Prove The Dirichlet Unit Theorem

Chapter 13: Basic ring theory

A New Generic Digital Signature Algorithm

CSCE 465 Computer & Network Security

6.080/6.089 GITCS Feb 12, Lecture 3

Exploring Students' use of e-learning systems in Higher education

Cryptography Lecture 8. Digital signatures, hash functions

Alexander Hulpke Department of Mathematics Colorado State University Fort Collins, CO, 80523, USA

VoIP Security. Seminar: Cryptography and Security Michael Muncan

Lightweight MDS Involution Matrices

Transcription:

Aleksandra Mileva 1 and Smile Markovski 2 1 Faculty of Computer Science, University Goce Delčev, Štip 2 Faculty of Computer Science and Computer Engineering, University Ss. Cyril and Methodius - Skopje Republic of Macedonia Loops 11 July 25-27, Třešt, Czech Republic

Motivation Today, we can already speak about quasigroup based cryptography, because the number of new defined cryptographic primitives that use quasigroups is growing up: stream cipher EDON-80 (Gligoroski et al. (estream 2008)), hash functions EDON-R (Gligoroski et al. (SHA-3 2008)) and NaSHA (Markovski and Mileva (SHA-3 2008)), digital signature algorithm MQQ-DSA (Gligoroski et al. (ACAM 2008)), public key cryptosystem LQLP-s (for s {104, 128, 160}) (Markovski et al. (SCC 2010)), etc.

Motivation Different authors seek quasigroups with different properties. Definition (Gligoroski et al (2006)) A quasigroup (Q, ) of order r is said to be shapeless iff it is non-idempotent, non-commutative, non-associative, it does not have neither left nor right unit, it does not contain proper sub-quasigroups, and there is no k < 2r such that identities of the kinds x (x (x y)) = y, y = ((y x) x) x } {{ } } {{ } k k (1)

1 2 3 Different generalizations of the Feistel Network as orthomorphisms 4 5

1 2 3 Different generalizations of the Feistel Network as orthomorphisms 4 5

Complete mappings and orthomorphisms Definition (Mann (1949), Johnson et al (1961), Evans (1989)) A complete mapping of a quasigroup (group) (G, +) is a permutation φ : G G such that the mapping θ : G G defined by θ(x) = x + φ(x) (θ = I + φ, where I is the identity mapping) is again a permutation of G. The mapping θ is the orthomorphism associated to the complete mapping φ. A quasigroup (group) G is admissible if there is a complete mapping φ : G G.

Complete mappings and orthomorphisms If θ is the orthomorphism associated to the complete mapping φ, then φ is the orthomorphism associated to the complete mapping θ, The inverse of the complete mapping (orthomorphism) is also a complete mapping (orthomorphism) (Johnson et al (1961)), Two orthomorphisms θ 1 and θ 2 of G are said to be orthogonal if and only if θ 1 θ 1 2 is an orthomorphism of G too. Even more, every orthomorphism is orthogonal to I and θ 1 is orthogonal to θ if and only if θ 2 is an orthomorphism (Johnson et al (1961))

Sade s Diagonal method (Sade (1957)) Consider the group (Z n, +) and let θ be a permutation of the set Z n, such that φ(x) = x θ(x) is also a permutation. Define an operation on Z n by: x y = θ(x y) + y (2) where x, y Z n. Then (Z n, ) is a quasigroup (and we say that (Z n, ) is derived by θ).

Generalization Theorem Let φ be a complete mapping of the admissible group (G, +) and let θ be an orthomorphism associated to φ. Define operations and on G by x y = φ(y x) + y = θ(y x) + x, (3) x y = θ(x y) + y = φ(x y) + x, (4) where x, y G. Then (G, ) and (G, ) are quasigroups, opposite to each other, i.e., x y = y x for every x, y G.

Quasigroup conjugates Theorem Let φ : G G be a complete mapping of the abelian group (G, +) with associated orthomorphism θ : G G. Then all the conjugates of the quasigroup (G, ) can be obtain by the equation (4) and the following statements are true. a) The quasigroup (G, /) is derived by the orthomorphism θ 1 associated to the complete mapping φθ 1. b) The quasigroup (G, \) is derived by the orthomorphism θ( φ) 1 associated to the complete mapping ( φ) 1. c) The quasigroup (G, //) is derived by the orthomorphism φ( θ) 1 associated to the complete mapping ( θ) 1. d) The quasigroup (G, \\) is derived by the orthomorphism φ 1 associated to the complete mapping θφ 1. e) (G, ) = (G, ).

1 2 3 Different generalizations of the Feistel Network as orthomorphisms 4 5

If θ(0) 0 then the quasigroup (G, ) has no idempotent elements. (G, ) does not have a left unit and if θ is different to the identity mapping it does not have a right unit either. (G, ) is non-associative quasigroup. If θ(z) θ( z) z for some z G then (G, ) is non-commutative quasigroup.

The identity holds true in (G, ) iff θ l = I. The identity y = ((y x)... ) x } {{ } l x ( (x y)) = y } {{ } l holds true in (G, ) iff ( φ) l = I = (I θ) l.

If θ has a cycle containing 0 of length greater than G /2, then the quasigroup (G, ) cannot have a proper subquasigroup. The quasigroup (G, ) is without a proper subquasigroup if S G /2, where S = i=p+1 i=1 i=p+1 i=1 {θ i (0)} {λ i (0)} i=p+1 i=1 i=p+1 i=1 {θ(0) + θ i (0)} {λ(0) + λ i (0)} p = [ G /2] and λ = θ( φ) 1. i=p+1 i=1 i=p+1 i=1 {θ( θ i (0)) + θ i (0)} {λ( λ i (0)) + λ i (0)},

((x x)... ) x = θ l (0) + x, } {{ } x ( (x x)) = ( φ) l (0) + x. } {{ } (5) l l ((x/ x)/... )/x = (θ 1 ) l (0) + x, } {{ } x/(... (x /x)) = (φθ 1 ) l (0) + x, } {{ } (6) l l ((x\x) \... ) \ x = ( θ( φ) 1 ) l (0)+x, x \ ( \ (x \x)) = (( φ) 1 ) l (0)+x, } {{ } } {{ } l l ((x// x)//... )//x } {{ } l ((x \\ x) \\... ) \\x } {{ } l (7) = ( φ( θ) 1 ) l (0)+x, x//(... //(x //x)) = ( ( θ) 1 ) l (0)+x, } {{ } l (8) = ( φ 1 ) l (0) + x, x \\( \\(x \\ x)) = (θφ 1 ) l (0) + x. } {{ } l (9)

(G, ) as an shapeless quasigroup Theorem Let θ be an orthomorphism of the abelian group (G, +), and let (G, ) be a quasigroup derived by θ by the equation (4). If θ is with the following properties: a) θ(0) 0 b) θ k I for all k < 2 G c) (I θ) k I for all k < 2 G d) θ(z) θ( Z) Z for some Z G e) S G /2, then (G, ) is a shapeless quasigroup.

Example of a shapeless quasigroup The abelian group (Z2 4, ) is given. x 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 θ(x) 3 9 15 2 13 7 1 11 14 6 4 0 12 8 10 5 φ(x) = x θ(x) 3 8 13 1 9 2 7 12 6 15 14 11 0 5 4 10 We define the quasigroup operation as x y = θ(x y) y

Example of a shapeless quasigroup 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 3 8 13 1 9 2 7 12 6 15 14 11 0 5 4 10 1 9 2 0 12 3 8 13 6 14 7 10 15 4 1 11 5 2 15 3 1 10 5 14 11 0 12 9 4 13 6 8 2 7 3 2 14 11 0 15 4 1 10 8 13 12 5 9 7 6 3 4 13 6 3 8 7 12 9 5 4 1 0 14 2 11 10 15 5 7 12 9 2 13 6 4 8 0 5 15 1 10 3 14 11 6 1 10 15 4 11 7 5 14 2 12 6 3 8 13 0 9 7 11 0 5 14 6 10 15 4 13 3 2 7 12 9 8 1 8 14 7 6 3 8 13 12 2 11 0 5 9 1 10 15 4 9 6 15 2 7 12 9 3 13 1 10 8 4 11 0 5 14 10 4 1 12 5 14 0 10 15 7 11 9 2 13 6 3 8 11 0 5 4 13 1 15 14 11 10 6 3 8 7 12 9 2 1212 9 8 6 10 3 2 7 5 14 11 0 15 4 1 13 13 8 13 7 9 2 11 6 3 15 4 1 10 5 14 12 0 1410 4 14 11 0 5 8 1 9 2 7 12 3 15 13 6 15 5 11 10 15 4 1 0 9 3 8 13 6 14 2 7 12

1 2 3 Different generalizations of the Feistel Network as orthomorphisms 4 5

Different generalizations of the Feistel Network Feistel Networks are introduced by H. Feistel (Scientific American, 1973). Parameterized Feistel Network (PFN) (Markovski and Mileva (QRS 2009)), Extended Feistel networks type-1, type-2 and type-3 (Zheng et al (CRYPTO 1989)), Generalized Feistel-Non Linear Feedback Shift Register (GF-NLFSR) (Choy et al (ACISP 2009)). We will redefine the last two generalizations with parameters and over abelian groups.

Parameterized Feistel Network (PFN) Definition Let (G, +) be an abelian group, let f : G G be a mapping and let A, B, C G are constants. The Parameterized Feistel Network F A,B,C : G 2 G 2 created by f is defined for every l, r G by F A,B,C (l, r) = (r + A, l + B + f (r + C)).

Parameterized Feistel Network (PFN) In (Markovski and Mileva (QRS 2009)) is shown that if starting mapping f is bijection, the Parameterized Feistel Network F A,B,C and its square F 2 A,B,C are orthomorphisms of the group (G 2, +). More over, they are orthogonal orthomorphisms.

Parameterized Extended Feistel Network (PEFN) type-1 Definition Let (G, +) be an abelian group, let f : G G be a mapping, let A 1, A 2,..., A n+1 G are constants and let n > 1 be an integer. The Parameterized Extended Feistel Network (PEFN) type-1 F A1,A 2,...,A n+1 : G n G n created by f is defined for every (x 1, x 2,..., x n ) G n by F A1,A 2,...,A n+1 (x 1, x 2,..., x n ) = (x 2 + f (x 1 + A 1 ) + A 2, x 3 + A 3,..., x n + A n, x 1 + A n+1 ).

Parameterized Extended Feistel Network (PEFN) type-1

Parameterized Extended Feistel Network (PEFN) type-1 Theorem Let (G, +) be an abelian group, let n > 1 be an integer and A 1, A 2,..., A n+1 G. If F A1,A 2,...,A n+1 : G n G n is a PEFN type-1 created by a bijection f : G G, then F A1,A 2,...,A n+1 is an orthomorphism of the group (G n, +).

Parameterized Generalized Feistel-Non Linear Feedback Shift Register (PGF-NLFSR) Definition Let (G, +) be an abelian group, let f : G G be a mapping, let A 1, A 2,..., A n+1 G are constants and let n > 1 be an integer. The Parameterized Generalized Feistel-Non Linear Feedback Shift Register (PGF-NLFSR) F A1,A 2,...,A n+1 : G n G n created by f is defined for every (x 1, x 2,..., x n ) G n by F A1,A 2,...,A n+1 (x 1, x 2,..., x n ) = (x 2 + A 1, x 3 + A 2,..., x n + A n 1, x 2 +... + x n + A n + f (x 1 + A n+1 )).

Parameterized Generalized Feistel-Non Linear Feedback Shift Register (PGF-NLFSR)

Parameterized Generalized Feistel-Non Linear Feedback Shift Register (PGF-NLFSR) Theorem Let we use the abelian group (Z m 2, ), let n = 2k be an integer and A 1, A 2,..., A n+1 Z m 2. If F A 1,A 2,...,A n+1 : (Z m 2 )n (Z m 2 )n is a PGF-NLFSR created by a bijection f : Z m 2 Zm 2, then is an orthomorphism of the group ((Z m 2 )n, ). F A1,A 2,...,A n+1

1 2 3 Different generalizations of the Feistel Network as orthomorphisms 4 5

Quasigroups derived by the PFN F A,B,C Proposition Let (G, +) be an abelian group and let f : G G be a bijection. Let F A,B,C be a Parameterized Feistel Network created by f, and let (G 2, ) be a quasigroup derived by F A,B,C by the equation (4). If F A,B,C is with the following properties: a)a 0 or B f (C) b) F k A,B,C I for all k < 2 G 2 c) (I F A,B,C ) k I for all k < 2 G 2 d) S G 2 /2, then (G 2, ) is a shapeless quasigroup.

Quasigroups derived by the PFN F A,B,C We made a m-file in MatLab that produce a starting bijection f : Z2 n Z 2 n and parameters A, B and C for the orthomorphism PFN F A,B,C which produce a shapeless quasigroup. The group operation is XOR. For n = 3, 4, 5, 6 execution time is less than a minute and for n = 7 is less than five minutes. These results correspond to shapeless quasigroups of order 2 6, 2 8, 2 10, 2 12 and 2 14.

Quasigroups derived by the PEFN type-1 F A1,A 2,...,A n+1 Proposition Let (G, +) be an abelian group, let n > 1 be an integer, let A 1, A 2,..., A n+1 G and let f : G G be a bijection. Let F A1,A 2,...,A n+1 be a PEFN type-1 created by f, and let (G n, ) be a quasigroup derived by F A1,A 2,...,A n+1 by the equation (4). If F A1,A 2,...,A n+1 is with the following properties: a)a i 0 for some i {3, 4,..., n + 1} or A 2 f (A 1) b) FA k 1,A 2,...,A n+1 I for all k < 2 G n c) (I F A1,A 2,...,A n+1 ) k I for all k < 2 G n d) S G n /2, then (G n, ) is a shapeless quasigroup.

Quasigroups derived by the PGF-NLFSR F A1,A 2,...,A n+1 Proposition Let we use the abelian group (Z m 2, ), let n = 2k be an integer, let A 1, A 2,..., A n+1 Z m 2 and let f : Z m 2 Z m 2 be a bijection. Let F A1,A 2,...,A n+1 be a PGF-NLFSR created by f, and let ((Z m 2 ) n, ) be a quasigroup derived by F A1,A 2,...,A n+1 by the equation (4). If F A1,A 2,...,A n+1 is with the following properties: a) A i 0 for some i {1, 2,..., n 1} or A n f (A n+1) b) F k A 1,A 2,...,A n+1 I for all k < 2 G n c) (I F A1,A 2,...,A n+1 ) k I for all k < 2 G n d) S G n /2, then ((Z m 2 ) n, ) is a shapeless quasigroup.

1 2 3 Different generalizations of the Feistel Network as orthomorphisms 4 5

We give some constructions of shapeless quasigroups of different orders by using quasigroups produced by diagonal method from orthomorphisms. We show that PEFN type-1 produced by a bijection is an orthomorphism of the abelian group (G n, +) and that PGF-NLFSR produced by a bijection is an orthomorphism of the ((Z m 2 )n, ). Also, we parameterized these orthomorphisms for the need of cryptography, so we can work with different quasigroups in every iterations of the future cryptographic primitives.

THANKS FOR YOUR ATTENTION!!!