Isotopy of latin squares in cryptography

Abstract

 We present a new algorithm for a decision problem if two Latin
squares are isotopics. Our modication has the same complexity as Miller's algo-
rithm, 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.