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 λ >...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Malaysian Society for Cryptology Research
2009
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/17024/ http://psasir.upm.edu.my/id/eprint/17024/1/The%20beta-transformation%20a%20case%20study%20for%20chaos%20based%20cryptography.pdf |
| _version_ | 1848843125655601152 |
|---|---|
| author | Kamel Ariffin, Muhammad Rezal Md Noorani, Mohd Salmi |
| author_facet | Kamel Ariffin, Muhammad Rezal Md Noorani, Mohd Salmi |
| author_sort | Kamel Ariffin, Muhammad Rezal |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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 λ > 0 it ensures that the beta-transformation is a non-linear chaotic system. Finally, we will also attempt to build a discrete version of the beta-transformation. |
| first_indexed | 2025-11-15T08:10:03Z |
| format | Article |
| id | upm-17024 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T08:10:03Z |
| publishDate | 2009 |
| publisher | Malaysian Society for Cryptology Research |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-170242017-04-11T06:01:00Z http://psasir.upm.edu.my/id/eprint/17024/ The beta-transformation: a case study for chaos based cryptography Kamel Ariffin, Muhammad Rezal Md Noorani, Mohd Salmi 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 λ > 0 it ensures that the beta-transformation is a non-linear chaotic system. Finally, we will also attempt to build a discrete version of the beta-transformation. Malaysian Society for Cryptology Research 2009 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/17024/1/The%20beta-transformation%20a%20case%20study%20for%20chaos%20based%20cryptography.pdf Kamel Ariffin, Muhammad Rezal and Md Noorani, Mohd Salmi (2009) The beta-transformation: a case study for chaos based cryptography. International Journal of Cryptology Research, 1 (2). pp. 205-214. ISSN 1985-5753 http://www.mscr.org.my/ijcr_volumes1(2).htm |
| spellingShingle | Kamel Ariffin, Muhammad Rezal Md Noorani, Mohd Salmi The beta-transformation: a case study for chaos based cryptography |
| title | The beta-transformation: a case study for chaos based cryptography |
| title_full | The beta-transformation: a case study for chaos based cryptography |
| title_fullStr | The beta-transformation: a case study for chaos based cryptography |
| title_full_unstemmed | The beta-transformation: a case study for chaos based cryptography |
| title_short | The beta-transformation: a case study for chaos based cryptography |
| title_sort | beta-transformation: a case study for chaos based cryptography |
| url | http://psasir.upm.edu.my/id/eprint/17024/ http://psasir.upm.edu.my/id/eprint/17024/ http://psasir.upm.edu.my/id/eprint/17024/1/The%20beta-transformation%20a%20case%20study%20for%20chaos%20based%20cryptography.pdf |