2024-03-29T14:00:52Zhttp://digital.csic.es/dspace-oai/requestoai:digital.csic.es:10261/237782016-02-16T07:33:50Zcom_10261_113com_10261_4col_10261_492
Caballero-Gil, P.
Fúster-Sabater, Amparo
Hernández-Goya, C.
2010-04-30T11:19:05Z
2010-04-30T11:19:05Z
2009-05
Proceedings of the 7th International Workshop on Security Information Systems, WOSIS 2009, in conjunction with ICEIS 2009
978-989-8111-91-3
http://hdl.handle.net/10261/23778
A new graph-based approach to edit distance cryptanalysis
of some clock-controlled generators is here presented in order to simplify
search trees of the original attacks. In particular, the proposed improve-
ment is based on cut sets de¯ned on some graphs so that only the most
promising branches of the search tree have to be analyzed because cer-
tain shortest paths provide the edit distances. The strongest aspects of
the proposal are: a) the obtained results from the attack are absolutely
deterministic and b) many inconsistent initial states are recognized be-
forehand and avoided during search.
eng
openAccess
Cryptanalysis
stream cipher
graphs
discrete mathematics
Deterministic Cryptanalysis of some Stream Ciphers
comunicación de congreso