• Corpus ID: 41610

On some quasigroup cryptographical primitives

@article{Csrg2011OnSQ,
  title={On some quasigroup cryptographical primitives},
  author={Piroska Cs{\"o}rg{\"o} and Victor A. Shcherbacov},
  journal={ArXiv},
  year={2011},
  volume={abs/1110.6591}
}
Using Vojvoda approach [34] we demonstrate that cryptographical primitives proposed in [26] are vulnerable relative to chosen ciphertext attack and chosen plaintext attack. We develop proposed in [31] modifications and add some new modifications of known quasigroup based stream ciphers [19, 26]. Systems of orthogonal n-ary groupoids are used. 
Quasigroup based crypto-algorithms
TLDR
Modifications of Markovski quasigroup based crypto-algorithm have been proposed, some of which are based on the systems of orthogonal n-ary groupoids.
New Developments in Quasigroup-Based Cryptography
TLDR
This chapter offers an overview of new developments in quasigroup-based cryptography, especially of new defined quasGovernments, including Multivariate Quadratic Quasigroups and MQQ public key schemes, because of their potential to become one of the most efficient pubic key algorithms today.
Non-associative public-key cryptography
  • A. Kalka
  • Mathematics, Computer Science
    AMS-EMS-SPM Joint Meeting
  • 2016
TLDR
It is shown that left selfdistributive systems appear in a natural special case of a generalized AAG-KEP for magmas, and it is proposed, among others instances, concrete realizations using $f$-conjugacy in groups and shifted conjugacy in braid groups.
Orthogonality of linear (alinear) quasigroups and their parastrophes
Necessary and sufficient conditions of orthogonality of left(right) linear (alinear) quasigroups in various combinations are given. As corollary we obtain conditions of parastroph orthogonality of

References

SHOWING 1-10 OF 54 REFERENCES
n-QUASIGROUP CRYPTOGRAPHIC PRIMITIVES: STREAM CIPHERS
TLDR
A practical implementation of these ciphers that has very good cryptographic properties is presented and is based on a design concept of mixing two ”incompatible” group operations on the set Z28.
Quasigroups in cryptology
  • V. Shcherbacov
  • Mathematics, Computer Science
    Comput. Sci. J. Moldova
  • 2009
TLDR
This work reviews some known published applications of quasi- groups in cryptology and gives a review of the quasigroup, stream- cipher, secret-sharing system, and zero knowledge protocol applications.
Using quasigroups for one one secure encoding
TLDR
A method for encrypting messages based on the properties of the quasigroups is applied guarantying a very fast implementation of AMS Mathematics Subject Classi cation A P N.
ON SOME KNOWN POSSIBLE APPLICATIONS OF QUASIGROUPS IN CRYPTOLOGY
It is surveyed known (published) possible application of binary and n-ary quasigroups in cryptology. Mathematics Subject Classification: 20N05, 94A60.
Isotopy of latin squares in cryptography
TLDR
A new algorithm for a decision problem if two Latin squares are isotopic is presented, which has the same complexity as Miller’s algorithm, but in many practical situations is much faster.
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of
On orthogonality of binary operations and squares
Orthogonality of a pair of binary groupoids, left quasigroups and quasi- groups from some points of view is studied. Necessary and sufficient conditions of orthogonality of a finite quasigroup and
Latin cubes orthogonal to their transposes a ternary analogue of stein quasigroups
In [3], S. K. Stein pointed out that the latin square which is the multiplication table of a quasigroup satisfying the identity x ( x y ) = y x is orthogonal to its transpose. We wish to illustrate
Pairwise orthogonality of n-ary operations
Abstract. The notions of hypercube and of the orthogonality of two hypercubeswere arised in combinatorial analysis. In [11] a connection between n-dimensionalhypercubes and algebraic n-ary operations
Solution of Belousov's problem
The authors prove that a local $n$-quasigroup defined by the equation x_{n+1} = F (x_1, ..., x_n) = [f_1 (x_1) + ... + f_n (x_n)]/[x_1 + ... + x_n], where f_i (x_i), i, j = 1, ..., n, are arbitrary
...
1
2
3
4
5
...