Please use this identifier to cite or link to this item: https://doi.org/10.1063/1.1633492
DC FieldValue
dc.titleError function attack of chaos synchronization based encryption schemes
dc.contributor.authorWang, X.
dc.contributor.authorZhan, M.
dc.contributor.authorLai, C.-H.
dc.contributor.authorGang, H.
dc.date.accessioned2014-12-12T07:31:28Z
dc.date.available2014-12-12T07:31:28Z
dc.date.issued2004-03
dc.identifier.citationWang, X., Zhan, M., Lai, C.-H., Gang, H. (2004-03). Error function attack of chaos synchronization based encryption schemes. Chaos 14 (1) : 128-137. ScholarBank@NUS Repository. https://doi.org/10.1063/1.1633492
dc.identifier.issn10541500
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/115706
dc.description.abstractDifferent chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the error function attack is presented systematically and used to evaluate system security. We define a quantitative measure (quality factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from quality factor. © 2004 American Institute of Physics.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1063/1.1633492
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentPHYSICS
dc.contributor.departmentTEMASEK LABORATORIES
dc.description.doi10.1063/1.1633492
dc.description.sourcetitleChaos
dc.description.volume14
dc.description.issue1
dc.description.page128-137
dc.identifier.isiut000189264700016
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.