Ponencia
Latin squares associated to principal autotopisms of long cycles. Application in Cryptography
Autor/es | Falcón Ganfornina, Raúl Manuel |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2006-04 |
Fecha de depósito | 2018-01-18 |
Publicado en |
|
Resumen | 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 ... 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. |
Cita | 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
4. TC2006-Proceedings.pdf | 361.7Kb | [PDF] | Ver/ | |