Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham e-Theses
You are in:

Analysis and Design Security Primitives Based on Chaotic Systems for eCommerce

MAQABLEH, MAHMOUD,MOHAMMAD (2012) Analysis and Design Security Primitives Based on Chaotic Systems for eCommerce. Doctoral thesis, Durham University.

[img]
Preview
PDF (Maqableh's Thesis) - Accepted Version
5Mb

Abstract

Security is considered the most important requirement for the success of electronic commerce, which is built based on the security of hash functions, encryption algorithms and pseudorandom number generators. Chaotic systems and security algorithms have similar properties including sensitivity to any change or changes in the initial parameters, unpredictability, deterministic nature and random-like behaviour. Several security algorithms based on chaotic systems have been proposed; unfortunately some of them were found to be insecure and/or slow.

In view of this, designing new secure and fast security algorithms based on chaotic systems which guarantee integrity, authentication and confidentiality is essential for electronic commerce development. In this thesis, we comprehensively explore the analysis and design of security primitives based on chaotic systems for electronic commerce: hash functions, encryption algorithms and pseudorandom number generators. Novel hash functions, encryption algorithms and pseudorandom number generators based on chaotic systems for electronic commerce are proposed. The securities of the proposed algorithms are analyzed based on some well-know statistical tests in this filed. In addition, a new one-dimensional triangle-chaotic map (TCM) with perfect chaotic behaviour is presented.

We have compared the proposed chaos-based hash functions, block cipher and pseudorandom number generator with well-know algorithms. The comparison results show that the proposed algorithms are better than some other existing algorithms. Several analyses and computer simulations are performed on the proposed algorithms to verify their characteristics, confirming that these proposed algorithms satisfy the characteristics and conditions of security algorithms. The proposed algorithms in this thesis are high-potential for adoption in e-commerce applications and protocols.

Item Type:Thesis (Doctoral)
Award:Doctor of Philosophy
Keywords:Security; electronic commerce; hash functions, encryption; pseudorandom number generators; chaotic systems; triangle-chaotic map
Faculty and Department:Faculty of Science > Engineering and Computing Science, School of
Thesis Date:2012
Copyright:Copyright of this thesis is held by the author
Deposited On:13 Apr 2012 12:47

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitter