City University of Hong Kong

CityU Institutional Repository >
3_CityU Electronic Theses and Dissertations >
ETD - Dept. of Electronic Engineering  >
EE - Master of Philosophy  >

Please use this identifier to cite or link to this item:

Title: Security enhancement on the cryptosystem based on chaotic and elliptic curve cryptography
Other Titles: Hun dun he tuo yuan qu xian mi ma xi tong de bao an qiang hua
Authors: Man, Kwan Pok (閔鈞博)
Department: Dept. of Electronic Engineering
Degree: Master of Philosophy
Issue Date: 2006
Publisher: City University of Hong Kong
Subjects: Computer security
Curves, Elliptic -- Data processing
Internet -- Security measures
Notes: CityU Call Number: QA76.9.A25 M355 2006
Includes bibliographical references (leaves 93-97)
Thesis (M.Phil.)--City University of Hong Kong, 2006
viii, 98 leaves : ill. (some col.) ; 30 cm.
Type: Thesis
Abstract: In the past few years, the number of individuals accessing Internet for information, entertainment and services increases rapidly. Internet consists of tremendous number of separate networks interconnected by routers and there is no guarantee that the data transmitted have not been intercepted in between. Therefore, cryptographic techniques are always employed to protect critical and confidential data against malicious attack from the intruders. Although the Internet now has implemented a suite of security protocols, it cannot be considered as absolutely unbreakable. To deal with the unforeseen attacks, the research on cryptography will never stop and the emergence of new and stronger cryptographic algorithms is always expected. The realization of chaos for cryptographic purpose has attracted interests from both researchers and cryptanalysts. Based on some previous works, we propose a modified cryptographic algorithm which overcomes the known weaknesses. The proposed scheme possesses the favorable properties such as ergodicity, dynamical and sensitivity to initial condition which are essential for high security data encryption. Elliptic curve cryptography (ECC) is well known as a public-key cryptographic infrastructure. Because of its small key size and high strength-per-key-bit properties, it is advantageous over other counterparts especially for portable devices and smart cards. Moreover, it has already been adopted in various standards among which some are endorsed by the US government. It has great potential to become the dominant next generation public-key cryptographic standard. We intend to use an ECC-based key agreement protocol to derive a common secret for both entities without using a private channel. Fast algorithms for the computation of scalar multiplication in ECC will be studied. In this thesis, the proposed chaotic cryptographic scheme is employed for data encryption while ECC with fast implementation is used for key exchange. The cooperation between these two types of cryptographic scheme enforces secure and efficient data transmission. This approach has been implemented and tested in practical communication systems. Experimental results show that it is fast while security analyses indicate that it is secure.
Online Catalog Link:
Appears in Collections:EE - Master of Philosophy

Files in This Item:

File Description SizeFormat
fulltext.html159 BHTMLView/Open
abstract.html159 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer