Summary
International Symposium on Nonlinear Theory and its Applications
2005
Session Number:2-4-1
Session:
Number:2-4-1-1
Chaos-based Cryptography: an overview
Ljupco Kocarev, Jose M. Amigo, Janusz Szczepanski,
pp.453-456
Publication Date:2005/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.40.2-4-1-1
PDF download (62KB)
Summary:
We review some of the recent work on chaos-based cryptography. We argue that if a chaotic map f is used in cryptography, then it should be implemented as a bijection FM : D → D, where D is a finite set with cardinality M, such that, for large M, FM ‘approximates well’ the chaotic map f . Several examples, including chaotic block cypher and chaotic public-key encryption algorithm, are given.