English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/24528
COMPARTIR / IMPACTO:
Estadísticas
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Título

A Simple Attack on Some Clock-Controlled Generators

AutorCaballero-Gil, P.; Fúster-Sabater, A.
Palabras claveCryptanalysis
Stream Cipher
Graphs
Edit Distance
Fecha de publicación1-jul-2009
EditorElsevier
CitaciónComputers and Mathematics with Applications
Serie58, No. 1
pp. 179-188
ResumenWe present a new approach to edit distance attacks on certain clock-controlled generators, which applies basic concepts of Graph Theory to simplify the search trees of the original attacks in such a way that only the most promising branches are analyzed. In particular, the proposed improvement is based on cut sets de ned on some graphs so that certain shortest paths provide the edit distances. The strongest aspects of the proposal are that the obtained results from the attack are absolutely deterministic, and that many inconsistent initial states of the target registers are recognized beforehand and avoided during search.
Versión del editorhttp://dx.doi.org/10.1016/j.camwa.2009.03.103
URIhttp://hdl.handle.net/10261/24528
DOI10.1016/j.camwa.2009.03.103
Aparece en las colecciones: (IFA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
CAM9174.pdf1,08 MBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo
 


NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.