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

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

Opened Access Latin squares associated to principal autotopisms of long cycles. Application in Cryptography
Estadísticas
Icon
Exportar a
Autor: Falcón Ganfornina, Raúl Manuel
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Fecha: 2006-04
Publicado en: Transgressive Computing (2006), p 213-230
Tipo de documento: Ponencia
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 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.
Tamaño: 361.7Kb
Formato: PDF

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

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 InternacionalAttribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones