<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Isotopy of latin squares in cryptography

Department of Applied Informatics, Information Technology, Slovak University of Technology, SK–812-19 Bratislava, SLOVAKIA

Department of Applied Informatics, Information Technology, Slovak University of Technology, SK-812-19 Bratislava, SLOVAKIA

Tatra Mountains Mathematical Publications

{"article-title":"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...

Isotopy of latin squares in cryptography

Publicado en línea: 12 nov 2012

Páginas: 27 - 36

DOI: https://doi.org/10.2478/v10127-010-0003-z

Palabras clave
Latin squares, isotopy of quasigroups, zero-knowledge protocol.

This content is open access.

Isotopy of latin squares in cryptography

Publicado en línea: 12 nov 2012

Páginas: 27 - 36

DOI: https://doi.org/10.2478/v10127-010-0003-z

Palabras claveLatin squares, isotopy of quasigroups, zero-knowledge protocol.

This content is open access.

Palabras clave
Latin squares, isotopy of quasigroups, zero-knowledge protocol.