Add to ORKGMost of the lightweight block ciphers are build as S-P networks or Feistel networks, their generalization or variations. We represent the lightweight Feistel ciphers GOST and MIBS, and Generalized Feistel cipher Skipjack by quasigroup string transformations. For obtaining suitable representation we use the fact that Feistel round functions that are bijections can be considered as orthomorphisms of groups, and that give us a tool for creating wanted quasigroups
The standard representation of a quasigroup of order m uses m2 bits. In this paper, it is introduced...
AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify ...
Given a finite quasigroup (Q,*), a quasigroup string transformations e_l and d_l over the strings o...
There are several block ciphers designed by using Feistel networks or their generalization, and so...
Shapeless quasigroups are needed for cryptography purposes. In this paper, we construct shapeless qu...
In this paper we examine algebraic properties of quasigroups produced by diagonal method from orthom...
The quasigroup string transformations have been used for defining several crypto primitives. Based o...
In this paper we propose two new types of compression functions, based on quasigroup string transfor...
Quasigroups of huge order, like 2^256, 2^512, 2^1024, that can be effectively constructed, have imp...
Quasigroups are algebraic structures closely related to Latin squares which have many different appl...
The extended Feistel networks are defined elsewhere. Here we analyze the prop ratio tables of the e...
This chapter offers an overview of new developments in quasigroup-based cryptography, especially of...
Cryptology is the science of secret communication, which consists of two complementary disciplines: ...
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution...
A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary ...
The standard representation of a quasigroup of order m uses m2 bits. In this paper, it is introduced...
AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify ...
Given a finite quasigroup (Q,*), a quasigroup string transformations e_l and d_l over the strings o...
There are several block ciphers designed by using Feistel networks or their generalization, and so...
Shapeless quasigroups are needed for cryptography purposes. In this paper, we construct shapeless qu...
In this paper we examine algebraic properties of quasigroups produced by diagonal method from orthom...
The quasigroup string transformations have been used for defining several crypto primitives. Based o...
In this paper we propose two new types of compression functions, based on quasigroup string transfor...
Quasigroups of huge order, like 2^256, 2^512, 2^1024, that can be effectively constructed, have imp...
Quasigroups are algebraic structures closely related to Latin squares which have many different appl...
The extended Feistel networks are defined elsewhere. Here we analyze the prop ratio tables of the e...
This chapter offers an overview of new developments in quasigroup-based cryptography, especially of...
Cryptology is the science of secret communication, which consists of two complementary disciplines: ...
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution...
A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary ...
The standard representation of a quasigroup of order m uses m2 bits. In this paper, it is introduced...
AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify ...
Given a finite quasigroup (Q,*), a quasigroup string transformations e_l and d_l over the strings o...