Isotopy of latin squares in cryptography

Isotopy of latin squares in cryptography

We present a new algorithm for a decision problem if two Latin squares are isotopic. Our modification has the same complexity as Miller’s algorithm, but in many practical situations is much faster. Based on our results we study also a zero-knowledge protocol suggested in [3]. From our results it fol...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Tatra Mountains mathematical publications 2010-12, Vol.45 (1), p.27-36
Hauptverfasser: Grošek, Otokar, Sýs, Marek
Format: Artikel
Sprache:eng
Schlagworte:
isotopy of quasigroups
Latin squares
zero-knowledge protocol
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a new algorithm for a decision problem if two Latin squares are isotopic. Our modification has the same complexity as Miller’s algorithm, but in many practical situations is much faster. Based on our results we study also a zero-knowledge protocol suggested in [3]. From our results it follows that there are some problems in practical application of this protocol.
ISSN:1210-3195
DOI:10.2478/v10127-010-0003-z