Repositorio de producción científica de la Universidad de Sevilla

Latin squares associated to principal autotopisms of long cycles. Application in Cryptography

 

Advanced Search
 
Opened Access Latin squares associated to principal autotopisms of long cycles. Application in Cryptography
Cites
Show item statistics
Icon
Export to
Author: Falcón Ganfornina, Raúl Manuel
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2006-04
Published in: Transgressive Computing (2006), p 213-230
Document type: Presentation
Abstract: Fixed a principal isotopism $\Theta=(\alpha,\beta,\epsilon)\in S_n^3$, where $S_n$ is the symmetric group of the set $N=\{0,1,...,n-1\}$, we are going to study in this paper the number $\Delta(\Theta)$ of Latin squares having $\Theta$ as a principal autotopism. As an application in Cryptography, we use it in the construction of secret sharing schemes based in $\mathfrak{F}$-critical sets of Latin squares.
Cite: Falcón Ganfornina, R.M. (2006). Latin squares associated to principal autotopisms of long cycles. Application in Cryptography. En Transgressive Computing, Granada, Andalucía.Falcón Ganfornina, R.M. (2006). Latin squares associated to principal autotopisms of long cycles. Application in Cryptography. En Transgressive Computing, Granada, Andalucía.
Size: 361.7Kb
Format: PDF

URI: https://hdl.handle.net/11441/69179

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 InternacionalAttribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)