| Author | Kodituwakku, Saluka Ranasinghe |
| Call Number | AIT Thesis no. CS-95-29 |
| Subject(s) | Cryptography
|
| Note | A thesis submitted in partial fulfillment of the requirement for the degree of Master of
Science |
| Publisher | Asian Institute of Technology |
| Abstract | A cryptosystem is a method of disguising a message so that only certain people can see through the disguise. Objectives of this work are study about finite automaton public key cryptosystems and design a new finite automaton public key cryptosystem. In this thesis, two mathematical concepts, finite automata theory and modulo Arithmetics, have been used. In order to construct a secure system, all the finite automata have been constructed over Galois Field GF (q). In this work, two algorithms have been proposed and example key system have been constructed. The main properties of a cryptosystem are speed and security. Many of the proposed and used systems, based on different concepts, have speed problem. Therefore security and speed of the proposed system have been discussed. Performance of the system has been compared with that of the well-known RSA public key cryptosystem. Softwares have been implemented in C language. Source codes of the encryption and decryption programs are given. Source codes of signing and verification can be obtained by changing the initial state values of the given programs. |
| Year | 1995 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Yulu, Qi; |
| Examination Committee(s) | Huynh, Ngoc Phien;Sadananda, Ramakoti; |
| Scholarship Donor(s) | Japan 93-94; |
| Degree | Thesis (M.Sc.) - Asian Institute of Technology, 1995 |