The beta-transformation: a case study for chaos based cryptography

In this paper we study characteristics of the beta-transformation and its suitability as a candidate for implementation as a symmetric cryptosystem. For β > 1 the betatransformation is given by fβ (x) = βx(mod1) and x ∈ [0, 1]. It is well known that its Lyapunov exponent is λ = logβ. Since λ >...

全面介紹

Saved in:
書目詳細資料
Main Authors: Kamel Ariffin, Muhammad Rezal, Md Noorani, Mohd Salmi
格式: Article
語言:English
出版: Malaysian Society for Cryptology Research 2009
在線閱讀:http://psasir.upm.edu.my/id/eprint/17024/1/The%20beta-transformation%20a%20case%20study%20for%20chaos%20based%20cryptography.pdf
http://psasir.upm.edu.my/id/eprint/17024/
http://www.mscr.org.my/ijcr_volumes1(2).htm
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!