Trivium vs. Trivium Toy

We present the characteristic and minimal polynomials of the linear algorithms Trivium and Trivium Toy. We show the different cycles and mini-mum lengths obtained. The existence of initial states determining short cycles is verified. Finally, linear Trivium Toy is shown to be as cryptologically secu...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Castro Lechtaler, Antonio, Cipriano, Marcelo, García, Edith, Liporace, Julio César, Maiorano, Ariel, Malvacio, Eduardo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2014
Materias:
Ciencias Informáticas
Trivium
Trivium Toy
cycles
periods
weak initial states
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/42156
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
Descripción
Sumario:We present the characteristic and minimal polynomials of the linear algorithms Trivium and Trivium Toy. We show the different cycles and mini-mum lengths obtained. The existence of initial states determining short cycles is verified. Finally, linear Trivium Toy is shown to be as cryptologically secure as the linear Trivium algorithm.

Ejemplares similares