• Corpus ID: 9390820

Quasigroup based crypto-algorithms

@article{Shcherbacov2012QuasigroupBC,
  title={Quasigroup based crypto-algorithms},
  author={Victor A. Shcherbacov},
  journal={ArXiv},
  year={2012},
  volume={abs/1201.3016}
}
  • V. Shcherbacov
  • Published 14 January 2012
  • Mathematics, Computer Science
  • ArXiv
Modifications of Markovski quasigroup based crypto-algorithm have been proposed. Some of these modifications are based on the systems of orthogonal n-ary groupoids. T-quasigroups based stream ciphers have been constructed. 

Tables from this paper

Markovsky algorithm on i-invertibile groupoids
TLDR
This work proposes modification of Markovsky crypto-algorithm on n-ary groupoids that are invertible on at least one place and proposes a new algorithm called Markovsky Crypto-Algorithm for solving this problem.
Quasigroup-based Hybrid of a Code and a Cipher
TLDR
It is shown that a quasigroup-based hybrid of a code and a cipher is constructed that is able to solve the inequality of the following types: A, B, C, and D.
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.
Polynomially Complete Quasigroups of Prime Order
We formulate a polynomial completeness criterion for quasigroups of prime order, and show that verification of polynomial completeness may require time polynomial in order. The results obtained are
Cryptographically Suitable Quasigroups via Functional Equations
  • A. Krapez
  • Mathematics, Computer Science
    ICT Innovations
  • 2012
TLDR
A new method of solution of quadratic and parastrophically uncancelablle equations is given, using trees and dichotomies (a special equivalence relations) and general solution is given by closed formulas.
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
Kvasiryhmistä ja niiden sovelluksista

References

SHOWING 1-10 OF 85 REFERENCES
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.
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.
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.
On some quasigroup cryptographical primitives
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
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.
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.
Some Probabilistic Properties of Quasigroup Processed Strings Useful for Cryptanalysis
TLDR
The distribution of m-tuples in an arbitrary string processed by application of quasigroup E (n)-transformation is found and it can be used for statistical attack in order to discover the original message and an algorithm for this kind of attack is given.
Quasigroup String Processing
TLDR
It is shown that the mappings E n and D n have several useful properties suitable for many purposes in cryptography coding theory de ning and improving pseudo random generators.
Parastrophic Quasigroup String Processing
In this paper, we propose a new quasigroup string transformation based on quasigroup parastrophes. Using the proposed quasigroup string transformation, a new classification of quasigroups of order 4
On definitions of groupoids closely connected with quasigroups
Both "existential" and "equational" definitions of binary quasigroups and groupoids closely connected with quasigroups are given. It is proved that a groupoid (Q,·) is a quasigroup if and only if all
...
1
2
3
4
5
...