Trivium vs. Trivium Toy

Autores
Castro Lechtaler, Antonio; Cipriano, Marcelo; García, Edith; Liporace, Julio César; Maiorano, Ariel; Malvacio, Eduardo
Año de publicación
2014
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
III Workshop de Seguridad Informática (WSI)
Red de Universidades con Carreras de Informática (RedUNCI)
Materia
Ciencias Informáticas
Trivium
Trivium Toy
cycles
periods
weak initial states
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/42156
Acceder
id SEDICI_94c9c39c8f3cd334abd89642081d8c82
oai_identifier_str oai:sedici.unlp.edu.ar:10915/42156
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Trivium vs. Trivium ToyCastro Lechtaler, AntonioCipriano, MarceloGarcía, EdithLiporace, Julio CésarMaiorano, ArielMalvacio, EduardoCiencias InformáticasTriviumTrivium Toycyclesperiodsweak initial statesWe 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.III Workshop de Seguridad Informática (WSI)Red de Universidades con Carreras de Informática (RedUNCI)2014-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/42156enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:34:04Zoai:sedici.unlp.edu.ar:10915/42156Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:34:04.797SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Trivium vs. Trivium Toy
title Trivium vs. Trivium Toy
spellingShingle Trivium vs. Trivium Toy
Castro Lechtaler, Antonio
Ciencias Informáticas
Trivium
Trivium Toy
cycles
periods
weak initial states
title_short Trivium vs. Trivium Toy
title_full Trivium vs. Trivium Toy
title_fullStr Trivium vs. Trivium Toy
title_full_unstemmed Trivium vs. Trivium Toy
title_sort Trivium vs. Trivium Toy
dc.creator.none.fl_str_mv Castro Lechtaler, Antonio
Cipriano, Marcelo
García, Edith
Liporace, Julio César
Maiorano, Ariel
Malvacio, Eduardo
author Castro Lechtaler, Antonio
author_facet Castro Lechtaler, Antonio
Cipriano, Marcelo
García, Edith
Liporace, Julio César
Maiorano, Ariel
Malvacio, Eduardo
author_role author
author2 Cipriano, Marcelo
García, Edith
Liporace, Julio César
Maiorano, Ariel
Malvacio, Eduardo
author2_role author
author
author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Trivium
Trivium Toy
cycles
periods
weak initial states
topic Ciencias Informáticas
Trivium
Trivium Toy
cycles
periods
weak initial states
dc.description.none.fl_txt_mv 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.
III Workshop de Seguridad Informática (WSI)
Red de Universidades con Carreras de Informática (RedUNCI)
description 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.
publishDate 2014
dc.date.none.fl_str_mv 2014-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/42156
url http://sedici.unlp.edu.ar/handle/10915/42156
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260189595566080
score 13.13397

Publicaciones similares