A new direction in utilization of chaotic fractal functions for cryptosystems.
Ever since Baptista in 1998 introduced his cryptographic scheme utilizing the only in online version. ergodic property of chaotic maps which is able to produce different cipher values for the same plaintext within the same message, intense scrutiny has been given upon the design. The capability to d...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Book Section |
Published: |
Springer Berlin Heidelberg
2012
|
Online Access: | http://psasir.upm.edu.my/id/eprint/26445/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.upm.eprints.26445 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.264452014-01-27T07:13:51Z http://psasir.upm.edu.my/id/eprint/26445/ A new direction in utilization of chaotic fractal functions for cryptosystems. Kamel Ariffin, Muhammad Rezal Al-Saidi, Nadia M. G. Md. Said, Mohamad Rushdan Mahad, Z. Daud, M. A. Ever since Baptista in 1998 introduced his cryptographic scheme utilizing the only in online version. ergodic property of chaotic maps which is able to produce different cipher values for the same plaintext within the same message, intense scrutiny has been given upon the design. The capability to do the above mentioned output is akin to the Vigenere cipher and thus has the capacity to render an attacker with infinitely many choices (theoretically speaking) or in cryptographic terms would render an attacker to have a set off possible ciphertexts that could all have the possibility to just be mapped to a unique plaintext. This makes it computationally infeasible for the attacker to re-construct the correct plaintext. The Baptista design has been attacked and repaired many times. Alvarez noticed the characteristic of the cryptosystem that generates a sequence which can be exploited by an attacker. The attack which is dubbed the one-time pad attack is akin to an attack upon a One-Time-Pad (OTP) cryptosystem that reuses its key. Since then, attempts were made to redefine the cryptosystem such that it would be resistant towards the attack. Most of the attempts failed due to either the repaired cryptosystem still generates an exploitable sequence or it is not invertible. In this work we pair the Baptista design with a concept taken from the Iterated Function Systems (IFS). Although we did not encompass the whole concept of iterating the IFS, it could be seen that this could be easily done with the same desirable results. Four main outcomes are discussed. Beginning with the discussion on the infeasibility of Alvarez’s one-time pad attack on the design, we then discuss the quantitative properties of the design in discussing its cryptographic properties namely the Maximum Deviation Factor (MDF), Correlation Coefficient Factor (CCF) and the Strict Avalanche Criterion (SAC). Each experimental result shows promising results for this new design. Springer Berlin Heidelberg Banerjee, Santo Rondoni, Roberto Mitra, Mala 2012 Book Section PeerReviewed Kamel Ariffin, Muhammad Rezal and Al-Saidi, Nadia M. G. and Md. Said, Mohamad Rushdan and Mahad, Z. and Daud, M. A. (2012) A new direction in utilization of chaotic fractal functions for cryptosystems. In: Applications of Chaos and NonLinear Dynamics in Science and Engineering - Vol 2. Springer Berlin Heidelberg, Berlin, Germany, pp. 233-248. ISBN 9783642293283; EISBN: 9783642293290 10.1007/978-3-642-29329-0_9 |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
description |
Ever since Baptista in 1998 introduced his cryptographic scheme utilizing the only in online version. ergodic property of chaotic maps which is able to produce different cipher values for the same plaintext within the same message, intense scrutiny has been given upon the design. The capability to do the above mentioned output is akin to the Vigenere cipher and thus has the capacity to render an attacker with infinitely many choices (theoretically speaking) or in cryptographic terms would render an attacker to have a set off possible ciphertexts that could all have the possibility to just be mapped to a unique plaintext. This makes it computationally infeasible for the attacker to re-construct the correct plaintext. The Baptista design has been attacked and repaired many times. Alvarez noticed the characteristic of the cryptosystem that generates a sequence which can be exploited by an attacker. The attack which is dubbed the one-time pad attack is akin to an attack upon a One-Time-Pad (OTP) cryptosystem that reuses its key. Since then, attempts were made to redefine the cryptosystem such that it would be resistant towards the attack. Most of the attempts failed due to either the repaired cryptosystem still generates an exploitable sequence or it is not invertible. In this work we pair the Baptista design with a concept taken from the Iterated Function Systems (IFS). Although we did not encompass the whole concept of iterating the IFS, it could be seen that this could be easily done with the same desirable results. Four main outcomes are discussed. Beginning with the discussion on the infeasibility of Alvarez’s one-time pad attack on the design, we then discuss the quantitative properties of the design in discussing its cryptographic properties namely the Maximum Deviation Factor (MDF), Correlation Coefficient Factor (CCF) and the Strict Avalanche Criterion (SAC). Each experimental result shows promising results for this new design. |
author2 |
Banerjee, Santo |
author_facet |
Banerjee, Santo Kamel Ariffin, Muhammad Rezal Al-Saidi, Nadia M. G. Md. Said, Mohamad Rushdan Mahad, Z. Daud, M. A. |
format |
Book Section |
author |
Kamel Ariffin, Muhammad Rezal Al-Saidi, Nadia M. G. Md. Said, Mohamad Rushdan Mahad, Z. Daud, M. A. |
spellingShingle |
Kamel Ariffin, Muhammad Rezal Al-Saidi, Nadia M. G. Md. Said, Mohamad Rushdan Mahad, Z. Daud, M. A. A new direction in utilization of chaotic fractal functions for cryptosystems. |
author_sort |
Kamel Ariffin, Muhammad Rezal |
title |
A new direction in utilization of chaotic fractal functions for cryptosystems. |
title_short |
A new direction in utilization of chaotic fractal functions for cryptosystems. |
title_full |
A new direction in utilization of chaotic fractal functions for cryptosystems. |
title_fullStr |
A new direction in utilization of chaotic fractal functions for cryptosystems. |
title_full_unstemmed |
A new direction in utilization of chaotic fractal functions for cryptosystems. |
title_sort |
new direction in utilization of chaotic fractal functions for cryptosystems. |
publisher |
Springer Berlin Heidelberg |
publishDate |
2012 |
url |
http://psasir.upm.edu.my/id/eprint/26445/ |
_version_ |
1643828927002574848 |
score |
13.211869 |