Cover Image

Efficiency analysis for public key systems based on fractal functions.

In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals function...

Full description

Saved in:
Bibliographic Details
Main Authors: M. G. AL-Saidi, Nadia, Md. Said, Mohamad Rushdan, M. Ahmed, Adil
Format: Article
Language:English
English
Published: Science Publications 2011
Online Access:http://psasir.upm.edu.my/id/eprint/25175/1/Efficiency%20analysis%20for%20public%20key%20systems%20based%20on%20fractal%20functions.pdf
http://psasir.upm.edu.my/id/eprint/25175/
http://www.thescipub.com/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.25175
record_format eprints
spelling my.upm.eprints.251752015-10-19T23:33:30Z http://psasir.upm.edu.my/id/eprint/25175/ Efficiency analysis for public key systems based on fractal functions. M. G. AL-Saidi, Nadia Md. Said, Mohamad Rushdan M. Ahmed, Adil In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals functions were incorporated into public-key cryptosystem due to their complicated mathematical structure and deterministic nature that meet the cryptographic requirements. In this study we propose a new public key cryptosystem based on Iterated Function Systems (IFS). Results: In the proposed protocol, the attractor of the IFS is used to obtain public key from private one, which is then used with the attractor again to encrypt and decrypt the messages. By exchanging the generated public keys using one of the well known key exchange protocols, both parties can calculate a unique shared key. This is used as a number of iteration to generate the fractal attractor and mask the Hutchinson operator, so that, the known attacks will not work anymore. The algorithm is implemented and compared to the classical one, to verify its efficiency and security. We conclude that public key systems based on IFS transformation perform more efficiently than RSA cryptosystems in terms of key size and key space. Science Publications 2011 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/25175/1/Efficiency%20analysis%20for%20public%20key%20systems%20based%20on%20fractal%20functions.pdf M. G. AL-Saidi, Nadia and Md. Said, Mohamad Rushdan and M. Ahmed, Adil (2011) Efficiency analysis for public key systems based on fractal functions. Journal of Computer Science, 7 (4). pp. 526-532. ISSN 1549-3636 http://www.thescipub.com/ 10.3844/jcssp.2011.526.532 English
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/
language English
English
description In the last decade, dynamical systems were utilized to develop cryptosystems, which ushered the era of continuous value cryptography that transformed the practical region from finite field to real numbers. Approach: Taking the security threats and privacy issues into consideration, fractals functions were incorporated into public-key cryptosystem due to their complicated mathematical structure and deterministic nature that meet the cryptographic requirements. In this study we propose a new public key cryptosystem based on Iterated Function Systems (IFS). Results: In the proposed protocol, the attractor of the IFS is used to obtain public key from private one, which is then used with the attractor again to encrypt and decrypt the messages. By exchanging the generated public keys using one of the well known key exchange protocols, both parties can calculate a unique shared key. This is used as a number of iteration to generate the fractal attractor and mask the Hutchinson operator, so that, the known attacks will not work anymore. The algorithm is implemented and compared to the classical one, to verify its efficiency and security. We conclude that public key systems based on IFS transformation perform more efficiently than RSA cryptosystems in terms of key size and key space.
format Article
author M. G. AL-Saidi, Nadia
Md. Said, Mohamad Rushdan
M. Ahmed, Adil
spellingShingle M. G. AL-Saidi, Nadia
Md. Said, Mohamad Rushdan
M. Ahmed, Adil
Efficiency analysis for public key systems based on fractal functions.
author_facet M. G. AL-Saidi, Nadia
Md. Said, Mohamad Rushdan
M. Ahmed, Adil
author_sort M. G. AL-Saidi, Nadia
title Efficiency analysis for public key systems based on fractal functions.
title_short Efficiency analysis for public key systems based on fractal functions.
title_full Efficiency analysis for public key systems based on fractal functions.
title_fullStr Efficiency analysis for public key systems based on fractal functions.
title_full_unstemmed Efficiency analysis for public key systems based on fractal functions.
title_sort efficiency analysis for public key systems based on fractal functions.
publisher Science Publications
publishDate 2011
url http://psasir.upm.edu.my/id/eprint/25175/1/Efficiency%20analysis%20for%20public%20key%20systems%20based%20on%20fractal%20functions.pdf
http://psasir.upm.edu.my/id/eprint/25175/
http://www.thescipub.com/
_version_ 1643828582102859776
score 13.211869

Similar Items