Polynomial time algorithm for the two-side exponentiation problem about ergodic matrices over finite field |
| |
| Authors: | Chunsheng Gu Zhengjun Jing Zhiming Yu |
| |
| Institution: | 1. School of Computer Engineering, Jiangsu Teachers University of Technology, Changzhou, 213001, Jiangsu, China
2. School of Computer Science and Technology, University of Science and Technology of China, Hefei, 230027, Anhui, China
|
| |
| Abstract: | By using the minimal polynomial of ergodic matrix and the property of polynomial over finite field, we present a polynomial time algorithm for the two-side exponentiation problem about ergodic matrices over finite field (TSEPEM), and analyze the time and space complexity of the algorithm. According to this algorithm, the public key scheme based on TSEPEM is not secure. |
| |
| Keywords: | ergodic matrix characteristic polynomial finite field public key cryptography |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
