On finite automaton public-key cryptosystem

Tao, Renji; Chen, Shi‐Hua

doi:10.1016/s0304-3975(99)00070-5

Cited by 12 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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

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

show abstract

“…Firstly, the random number generator is independent from the key. Secondly, this system cannot be attacked with methods used for defeating FAPKC cryptosystems [4][5][6][7][8]. Thirdly, Dӧmӧsi's cryptosystem overcomes some complicated mechanisms in broadcasting/datacasting systems.…”

Section: Related Workmentioning

confidence: 99%

A New Block Cipher Based on Finite Automata Systems

Khaleel¹,

Turaev²,

Tamrin³

et al. 2016

IJPCC

View full text Add to dashboard Cite

The performance and security have central importance of cryptography field. Therefore, theneed to use block ciphers are become very important. This paper presents a new block cipher based on finiteautomata system. The proposed cryptosystem is executed based on parallel computations to reduce thedelay time. Moreover, to achieve high security, we use different machines (variant non-deterministicautomata accepters) as keys for encryption and decryption.

show abstract

“…It is widely believed that in practice it is hard to decompose a Turing machine into two parts. For example, a cryptosystem system based on the hardness of decomposition (and inverse) of finite automaton is suggested in Tao and Chen [13]. However, if M is just a simple composition of two TMs M1 and M2, then obviously one can construct M1 (and M2) from M easily.…”

Section: One Way Vcomb-combination Of Turing Machinesmentioning

confidence: 99%

Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses

Wang

2000

Information Security for Global Information Infrastructures

View full text Add to dashboard Cite

The theory of computer viruses has been studied by several authors, though there is no systematic theoretical study up to now. The long time open question in this area is as follows: Is it possible to design a signature-free (including dynamic signatures which we will define late) virus? In this paper, we give an affirmative answer to this question from a theoretical viewpoint. We will introduce a new stronger concept: dynamic signatures of viruses, and present a method to design viruses which are static signature-free and whose dynamic signatures are hard to determine unless some cryptographic assumption fails. We should remark that our results are only for theoretical interest and may be resource intensive in practice.

show abstract

On finite automaton public-key cryptosystem

Cited by 12 publications

References 0 publications

A Novel Stream Cipher Based on Nondeterministic Finite Automata

A Novel Stream Cipher Based on Nondeterministic Finite Automata

A New Block Cipher Based on Finite Automata Systems

Using Mobile Agent Results to Create Hard-to-Detect Computer Viruses

Contact Info

Product

Resources

About