Isotopy of latin squares in cryptography
Grošek, Otokar ; Sýs, Marek
Tatra Mountains Mathematical Publications, Tome 45 (2010), / Harvested from Mathematical Institute
Link
Link

 We present a new algorithm for a decision problem if two Latinsquares 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 westudy also a zero{knowledge protocol suggested in [3]. From our results it followsthat there are some problems in practical application of this protocol.

Publié le : 2010-01-01
DOI : https://doi.org/10.2478/tatra.v45i0.65 
@article{65,
     title = {Isotopy of latin squares in cryptography},
     journal = {Tatra Mountains Mathematical Publications},
     volume = {45},
     year = {2010},
     doi = {10.2478/tatra.v45i0.65},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/65}
}

Grošek, Otokar; Sýs, Marek. Isotopy of latin squares in cryptography. Tatra Mountains Mathematical Publications, Tome 45 (2010) . doi : 10.2478/tatra.v45i0.65. http://gdmltest.u-ga.fr/item/65/