Publication | Open Access
Isotopy of latin squares in cryptography
12
Citations
1
References
2010
Year
Mathematical ProgrammingComputational Complexity TheoryEngineeringCryptographic PrimitiveDecision ProblemAnalysis Of AlgorithmComputational ComplexityAlgorithm DesignZero-knowledge ProtocolDiscrete MathematicsCombinatorial OptimizationLatin SquaresCryptanalysisData Encryption StandardComputer ScienceAlgorithmic Information TheoryNew AlgorithmAlgorithmic DevelopmentData SecurityCryptographyAutomated ReasoningFormal Methods
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1