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

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...

Full description

Saved in:
Bibliographic Details
Main Author: Masoumi, Amir Akhavan
Format: Thesis
Language:English
Published: 2015
Subjects:
Online Access:http://eprints.usm.my/31377/1/AMIR_AKHAVAN.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my-usm-ep.31377
record_format uketd_dc
spelling my-usm-ep.313772019-04-12T05:25:41Z Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps 2015-08 Masoumi, Amir Akhavan QA75.5-76.95 Electronic computers. Computer science 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. 2015-08 Thesis http://eprints.usm.my/31377/ http://eprints.usm.my/31377/1/AMIR_AKHAVAN.pdf application/pdf en public phd doctoral Universiti Sains Malaysia Pusat Pengajian Sains Komputer
institution Universiti Sains Malaysia
collection USM Institutional Repository
language English
topic QA75.5-76.95 Electronic computers
Computer science
spellingShingle QA75.5-76.95 Electronic computers
Computer science
Masoumi, Amir Akhavan
Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps
description 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.
format Thesis
qualification_name Doctor of Philosophy (PhD.)
qualification_level Doctorate
author Masoumi, Amir Akhavan
author_facet Masoumi, Amir Akhavan
author_sort Masoumi, Amir Akhavan
title Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps
title_short Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps
title_full Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps
title_fullStr Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps
title_full_unstemmed Improving Chaotic Cryptographic Primitives Based On Map’s Complexity And Period Length Of The Chaotic Maps
title_sort improving chaotic cryptographic primitives based on map’s complexity and period length of the chaotic maps
granting_institution Universiti Sains Malaysia
granting_department Pusat Pengajian Sains Komputer
publishDate 2015
url http://eprints.usm.my/31377/1/AMIR_AKHAVAN.pdf
_version_ 1747820411707457536