RO EN
Non-associative algebraic system in cryptology. Protection against "meet in the middle" attack
Authors: Dénes J., Dénes T.
– 0.20 Mb
Abstract
In this paper we shall mention an algorithm of zero knowledge proof based on Latin squares. We shall define the DLm(n) type Latin squares, which have a further property that is stronger than the pan-Hamiltonian squares: Every pair of DLm(n) rows and columns is a cycle of length n, if n is prime.József Dénes
1122 Budapest,
Csaba u. 10,
Hungary.
____________
Tamás Dénes
1182 Budapest,
Marosvásárhely u. 13/a,
Hungary.
1122 Budapest,
Csaba u. 10,
Hungary.
____________
Tamás Dénes
1182 Budapest,
Marosvásárhely u. 13/a,
Hungary.
Fulltext
– 0.20 Mb
Contents
- On B-algebras and quasigroups
- Non-associative algebraic system in cryptology. Protection against "meet in the middle" attack
- On some old and new problems in n-ary groups
- Transversals in groups. 3.Semidirect product of a transversal operation and subgrouop
- Subtree-counting loops
- On quadratic B-algebras
- Algebras of vector-valued functions
- Representations of positional algebras
- The abstract groups (3, 3 | 3, p), their subgroup structure, and their significance for Paige loops
