Public Key Cryptosystem Based on Finite Automata for Multilateral Antiterrorist Activity Support

被引：2

作者：

Margarov, Gevorg ^{[1
]}

Chopuryan, Siranush ^{[1
]}

机构：

[1] State Engn Univ Armenia, Informat Secur & Software Dev Dept, Yerevan, Armenia

来源：

TERRORISM AND THE INTERNET: THREATS - TARGET GROUPS - DERADICALISATION STRATEGIES | 2010年 / 67卷

关键词：

Internet; antiterrorist activity; public key cryptosystem; finite automata;

D O I：

10.3233/978-1-60750-537-2-183

中图分类号：

DF [法律]; D9 [法律];

学科分类号：

0301 ;

摘要：

The public key cryptosystem based on finite automata has been represented in this article, which can be used to support of multilateral antiterrorist activity. The public key cryptosystem based on finite automata possesses high stability against information warfare, which allows protecting the secret information more effectively on the Internet from eavesdroppers. Such cryptosystem also possess high level of performance, which is defined by use fast logic operation at data encryption and decryption.

引用

页码：183 / 188

页数：6

共 8 条

[1] [Anonymous], 1979, COMPUT INTRACTABILIT
[2] [Anonymous], 1969, Prentice-Hall Series in Automatic Computation
[3] NEW DIRECTIONS IN CRYPTOGRAPHY
DIFFIE, W
HELLMAN, ME
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) : 644 - 654
[4] GOLDREICH O, 1987, LECT NOTES COMPUT SC, V263, P171
[5] Hopcroft John E., 2000, INTRO AUTOMATA THEOR
[6] Margarov G., 2007, P INT C COMP SCI INF, P112
[7] Papadimitriou C. H., 1993, COMPUT COMPLEX, P500
[8] Schneier B., 1996, APPL CRYPTOGRAPHY, P760

← 1 →