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 λ >...

Full description

Saved in:
Bibliographic Details
Main Authors: Kamel Ariffin, Muhammad Rezal, Md Noorani, Mohd Salmi
Format: Article
Language:English
Published: Malaysian Society for Cryptology Research 2009
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items