DocumentCode
2162159
Title
Finite automation cryptosystem
Author
Yulu, Qi ; Kodituwakku, S.R.
Author_Institution
Comput. Sci. Program, Asian Inst. of Technol., Bangkok, Thailand
fYear
1996
fDate
5-7 May 1996
Firstpage
244
Abstract
A new public key cryptosystem is proposed, together with signature capabilities. This system based on the invertibility of finite automata. The security of the system rests on the difficulty of finding inverse automatas and of factoring matrix polynomial over Galois field GF(2)
Keywords
Galois fields; finite automata; inverse problems; polynomial matrices; public key cryptography; Galois field; finite automata invertibility; finite automation cryptosystem; inverse automatas; matrix polynomial factoring; public key cryptosystem; signature capabilities; system security; Automata; Automatic testing; Computer science; Delay; Galois fields; Graphics; Mathematics; Polynomials; Public key cryptography; Software algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Technology Proceedings, 1996. ICCT'96., 1996 International Conference on
Conference_Location
Beijing
Print_ISBN
0-7803-2916-3
Type
conf
DOI
10.1109/ICCT.1996.545170
Filename
545170
Link To Document