DocumentCode
3539838
Title
Strong finite automata public key cryptosystem
Author
Chopuryan, Siranush ; Margarov, Gevorg
Author_Institution
State Eng. Univ. of Armenia, Yerevan, Armenia
fYear
2009
fDate
4-6 Aug. 2009
Firstpage
625
Lastpage
628
Abstract
Existing finite automata public key cryptosystems (FAPKC) are analyzed in this paper. Methods of breaking FAPKC by some known types of attacks are introduced. As a result, an improved FAPKC is designed in order to resist the presented types of attacks. Strong FAPKC is obtained by generating invertible nonlinear and linear automata of the suitable form.
Keywords
finite automata; public key cryptography; invertible linear automata; invertible nonlinear automata; strong finite automata public key cryptosystem; Automata; Delay lines; Equations; Public key; Public key cryptography; Resists; Stability; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Applications of Digital Information and Web Technologies, 2009. ICADIWT '09. Second International Conference on the
Conference_Location
London
Print_ISBN
978-1-4244-4456-4
Electronic_ISBN
978-1-4244-4457-1
Type
conf
DOI
10.1109/ICADIWT.2009.5273929
Filename
5273929
Link To Document