Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps

Masoumi, Amir Akhavan (2015) Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps. PhD thesis, Universiti Sains Malaysia.

Preview

PDF Download (1MB) | Preview

Abstract

Peta camuk berkentuan menghasilkan ciri-ciri seperti determinisme, ergodisiti, perlakuan seperti rawak, ketidaklineran, aperiodisiti, entropi yang tinggi, imbangan, ketak kemerostan, korelasi maklumat yang amat rendah, dan kepekaan/kesensitifan yang amat tinggi terhadap perubahan yang amat kecil daripada keadaan awal dan parameter kawalan. Deterministic chaotic maps possess profound characteristics such as determinism, ergodicity, random-like behavior, nonlinearity, aperiodicity, high entropy, balance, nondegeneracy, incredibly low correlation of information and extreme sensitivity to very small changes of the initial condition and control-parameters.

Item Type:	Thesis (PhD)
Subjects:	Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions:	Pusat Pengajian Sains Komputer (School of Computer Sciences) > Thesis
Depositing User:	Mr Firdaus Mohamad
Date Deposited:	04 Jan 2017 02:07
Last Modified:	12 Apr 2019 05:25
URI:	http://eprints.usm.my/id/eprint/31377

Actions (login required)

View Item