Chaotification Methods For Enhancing One-Dimension Digital Chaotic Maps For Applications In Cryptography
Digital one-dimensional chaotic maps are becoming increasingly popular in the area of cryptography due to their commonalities and their simple structures. However, these maps have well-known drawbacks which contribute negatively towards the security of the cryptographic algorithms that utilize th...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2022
|
| Subjects: | |
| Online Access: | http://eprints.usm.my/55548/ http://eprints.usm.my/55548/1/My_thesis_Final%20cut.pdf |
| _version_ | 1848883111278936064 |
|---|---|
| author | Alawida, Moatsum Khalif Oduh |
| author_facet | Alawida, Moatsum Khalif Oduh |
| author_sort | Alawida, Moatsum Khalif Oduh |
| building | USM Institutional Repository |
| collection | Online Access |
| description | Digital one-dimensional chaotic maps are becoming increasingly popular in the
area of cryptography due to their commonalities and their simple structures. However,
these maps have well-known drawbacks which contribute negatively towards
the security of the cryptographic algorithms that utilize them. Thus, enhancing digital
one-dimensional chaotic maps in terms of their chaoticity and statistical properties
will contribute towards the improvement of chaos-based cryptography. Many
chaotification methods have been recently proposed to address these issues. However,
most of these methods are dependent on an external entropy source to enhance
the characteristics of one-dimensional chaotic maps. In this study, four novel chaotification
methods are proposed to address these issues without the need of external
entropy sources. The first method hybridizes deterministic finite state automata with
one-dimensional chaotic maps under control the existing chaotification methods. The
aim of this method is to weaken dynamical degradation issue through prolonging cycle
length. To increase chaotic complexity and enlarge chaotic parameter range, the
second method is proposed based on modifying chaotic state values by reversing the
order of their fractional bits. To take advantage of the first two proposed methods, the
third method is proposed based on a one-dimensional chaotic map and deterministic
finite state machine under the control of bitwise permutations. The fourth method is
introduced based on cascade and combination methods as a simple framework to enlarge
the chaotic parameter range and to enhance chaotic performance. |
| first_indexed | 2025-11-15T18:45:37Z |
| format | Thesis |
| id | usm-55548 |
| institution | Universiti Sains Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T18:45:37Z |
| publishDate | 2022 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | usm-555482022-11-08T03:38:20Z http://eprints.usm.my/55548/ Chaotification Methods For Enhancing One-Dimension Digital Chaotic Maps For Applications In Cryptography Alawida, Moatsum Khalif Oduh QA75.5-76.95 Electronic computers. Computer science Digital one-dimensional chaotic maps are becoming increasingly popular in the area of cryptography due to their commonalities and their simple structures. However, these maps have well-known drawbacks which contribute negatively towards the security of the cryptographic algorithms that utilize them. Thus, enhancing digital one-dimensional chaotic maps in terms of their chaoticity and statistical properties will contribute towards the improvement of chaos-based cryptography. Many chaotification methods have been recently proposed to address these issues. However, most of these methods are dependent on an external entropy source to enhance the characteristics of one-dimensional chaotic maps. In this study, four novel chaotification methods are proposed to address these issues without the need of external entropy sources. The first method hybridizes deterministic finite state automata with one-dimensional chaotic maps under control the existing chaotification methods. The aim of this method is to weaken dynamical degradation issue through prolonging cycle length. To increase chaotic complexity and enlarge chaotic parameter range, the second method is proposed based on modifying chaotic state values by reversing the order of their fractional bits. To take advantage of the first two proposed methods, the third method is proposed based on a one-dimensional chaotic map and deterministic finite state machine under the control of bitwise permutations. The fourth method is introduced based on cascade and combination methods as a simple framework to enlarge the chaotic parameter range and to enhance chaotic performance. 2022-03 Thesis NonPeerReviewed application/pdf en http://eprints.usm.my/55548/1/My_thesis_Final%20cut.pdf Alawida, Moatsum Khalif Oduh (2022) Chaotification Methods For Enhancing One-Dimension Digital Chaotic Maps For Applications In Cryptography. PhD thesis, Universiti Sains Malaysia. |
| spellingShingle | QA75.5-76.95 Electronic computers. Computer science Alawida, Moatsum Khalif Oduh Chaotification Methods For Enhancing One-Dimension Digital Chaotic Maps For Applications In Cryptography |
| title | Chaotification Methods For
Enhancing One-Dimension Digital
Chaotic Maps For Applications In
Cryptography |
| title_full | Chaotification Methods For
Enhancing One-Dimension Digital
Chaotic Maps For Applications In
Cryptography |
| title_fullStr | Chaotification Methods For
Enhancing One-Dimension Digital
Chaotic Maps For Applications In
Cryptography |
| title_full_unstemmed | Chaotification Methods For
Enhancing One-Dimension Digital
Chaotic Maps For Applications In
Cryptography |
| title_short | Chaotification Methods For
Enhancing One-Dimension Digital
Chaotic Maps For Applications In
Cryptography |
| title_sort | chaotification methods for
enhancing one-dimension digital
chaotic maps for applications in
cryptography |
| topic | QA75.5-76.95 Electronic computers. Computer science |
| url | http://eprints.usm.my/55548/ http://eprints.usm.my/55548/1/My_thesis_Final%20cut.pdf |