RO  EN
IMI/Publicaţii/QRS/Ediţii/QRS v.8, n.1 (8), 2001/

Non-associative algebraic system in cryptology. Protection against "meet in the middle" attack

Authors: Dénes J., Dénes T.

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.

Fulltext

Adobe PDF document0.20 Mb