Displaying similar documents to “Edon- ℛ ( 256 , 384 , 512 ) – an efficient implementation of Edon- ℛ family of cryptographic hash functions”

A geometric approach to universal quasigroup identities

Václav J. Havel (1993)

Archivum Mathematicum

Similarity:

In the present paper we construct the accompanying identity I ^ of a given quasigroup identity I . After that we deduce the main result: I is isotopically invariant (i.e., for every guasigroup Q it holds that if I is satisfied in Q then I is satisfied in every quasigroup isotopic to Q ) if and only if it is equivalent to I ^ (i.e., for every quasigroup Q it holds that in Q either I , I ^ are both satisfied or both not).

Generating quasigroups for cryptographic applications

Czesław Kościelny (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the ciphertext. From the practical viewpoint, the most important quasigroups...

Ternary quasigroups and the modular group

Jonathan D. H. Smith (2008)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

For a positive integer n , the usual definitions of n -quasigroups are rather complicated: either by combinatorial conditions that effectively amount to Latin n -cubes, or by 2 n identities on n + 1 different n -ary operations. In this paper, a more symmetrical approach to the specification of n -quasigroups is considered. In particular, ternary quasigroups arise from actions of the modular group.