Two varieties of finite automaton public key cryptosystem and digital signatures

1986 ◽  
Vol 1 (1) ◽  
pp. 9-18 ◽  
Author(s):  
Renji Tao ◽  
Shihua Chen
1999 ◽  
Vol 226 (1-2) ◽  
pp. 143-172 ◽  
Author(s):  
Renji Tao ◽  
Shihua Chen

1970 ◽  
Vol 3 (1) ◽  
pp. 22-30
Author(s):  
Saba Inam ◽  
Shamsa Kanwal ◽  
Adnan Zahid ◽  
Maria Abid

In this article, we develop a new algebraic public key cryptosystem, which is based on generally non-commutative ring. Firstly, we define the polynomials over the non-commutative rings and then take it as underlying work structure. The hard problem of the scheme is the mixture of matrix discrete log problem under modular classes and polynomial symmetric decomposition problem. Using matrices of higher order and large modular classes resist the brute force and other well-known attacks exists in the literature. We also discuss the computational complexity of proposed scheme. On the other hand, we propose a signature scheme over a non-commutative division semiring. The key idea behind the signature scheme is that, for a given non-commutative division semiring, we build a polynomial and then implement digital signatures on multiplicative structure of semiring.


1997 ◽  
Vol 12 (4) ◽  
pp. 289-305 ◽  
Author(s):  
Renji Tao ◽  
Shihua Chen ◽  
Xuemei Chen

Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI

2011 ◽  
Vol 30 (6) ◽  
pp. 1450-1452 ◽  
Author(s):  
Zheng-tao Jiang ◽  
Jing-liang Zhang ◽  
Yu-min Wang

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena

Sign in / Sign up

Export Citation Format

Share Document