FAPKC3: A new finite automaton public key cryptosystem

Tao, Renji; Chen, Shi‐Hua

doi:10.1007/bf02943149

Cited by 22 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• The size of a user's public key is rather small but longer than RSA [24]; about 3200 bits for a moderate size of public key in an implementation of FAPKC3 [5].…”

Section: Discussion On Application Of Fapkcmentioning

confidence: 99%

“…Many concrete schemes have been proposed and found important applications in the area of information security. Among others, there are several public key cryptosystems based on finite automata theory, such as FAPKC0 in Tao and Chen [2], FAPKC1 and FAPKC2 in Tao and Chen [3], FAPKC93 in Gao [4], FAPKC3 in Tao et al [5] and a special case of FAPKC2 in Bao and Igarashi [6]. These finite automaton public key cryptosystems (FAPKCs) possess merits such as fast speed, relatively short public key, capability of digital signature, etc.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, it was discovered that FAPKC0, FAPKC1 and FAPKC93 are insecure with respect to digital signatures [17] as well as insecure with respect to encryption [6,13,17] In general, FAPKC2 is insecure against attacks [6,13,17], but Bao and Igarashi's key-generating scheme of FAPKC2 [6] is insecure because it cannot resist linear R a , R b attack [18]. FAPKC3's key generator selects automata in the user's key by means of linear and/or non-linear R a , R b transformation and their reverse transformation, and sieves out such a key in which the compound automaton's weak inverse can be found out by the linear R a , R b transformation method [5,18]. So FAPKC3 can resist linear R a , R b attack.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A variant of the public key cryptosystem FAPKC3

Tao

Chen

1997

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

“…• The size of a user's public key is rather small but longer than RSA [24]; about 3200 bits for a moderate size of public key in an implementation of FAPKC3 [5].…”

Section: Discussion On Application Of Fapkcmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A variant of the public key cryptosystem FAPKC3

Tao

Chen

1997

Journal of Network and Computer Applications

Self Cite

View full text Add to dashboard Cite

“…Since then various public key cryptosystems based on finite automata have been proposed like FAPKC1, FAPKC2, FAPKC93, FAPKC3 and FAPKC4 [17,18,19]. In contrast to this, fewer single key cryptosystems based on finite automata have been proposed though the underlying theory behind both are similar.…”

Section: Related Workmentioning

confidence: 94%

DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem

Abubaker

2013

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. Unlike most cryptosystems which rely on number theoretic problems, cryptosystems based on the invertibility of finite automata are lightweight in nature and can be implemented easily using simple logical operations, thus affording fast encryption and decryption. In this paper, we propose and implement a new variant of finite automaton cryptosystem, which we call DES-Augmented Finite Automaton (DAFA) cryptosystem. DAFA uses the key generation algorithm of the Data Encryption Standard (DES) to dynamically generate linear and non-linear finite automata on the fly using a 128-bit key. Compared to existing finite automaton cryptosystems, DAFA provides stronger security yet has similar encryption/decryption speeds. DAFA is also faster than popular single key cryptosystems such as Advanced Encryption Standard (AES). The test results on desktop and mobile phones with respect to the running speed and security properties are very promising.

show abstract

“…Firstly, the random number generator is independent from the key. Secondly, the weakly reversibility of automata does not affect the cryptosystem, so this system cannot be attacked with methods used for defeating FAPKC cryptosystems [5][6][7][8][9][10]. Thirdly, the key automaton is chosen randomly from a large set of automata with more than 256 states and more that 256 input signals, i.e., more than 256 (256!)…”

Section: Related Workmentioning

confidence: 99%

A Novel Stream Cipher Based on Nondeterministic Finite Automata

Khaleel

Turaev²,

Zhukabayeva³

2016

Proceedings of the 2016 Conference on Information Technologies in Science, Management, Social Sphere and Medicine

View full text Add to dashboard Cite

Abstract-The modified Dӧmӧsi's cryptosystem [1] is a stream cipher based on deterministic finite automata without outputs for encoding and decoding. This cryptosystem uses an additional control system to improve the performance to a better linear time without backtracking. This paper, we propose a nondeterministic variant of the cryptosystem, which allows to reduce the dependency of the key automata on a large size and on reversibility of automata.

show abstract

FAPKC3: A new finite automaton public key cryptosystem

Cited by 22 publications

References 10 publications

A variant of the public key cryptosystem FAPKC3

A variant of the public key cryptosystem FAPKC3

DAFA - A Lightweight DES Augmented Finite Automaton Cryptosystem

A Novel Stream Cipher Based on Nondeterministic Finite Automata

Contact Info

Product

Resources

About