Security Analysis of DBTRU Cryptosystem |
| |
| Authors: | Xiaofei Tong Jingguo Bi Yufei Duan Lixiang Li Licheng Wang |
| |
| Affiliation: | 1.School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China;2.State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;3.State Key Laboratory of Cryptology, P.O. Box 5159, Beijing 100878, China |
| |
| Abstract: | DBTRU was proposed by Thang and Binh in 2015. As a variant of NTRU, the integer polynomial ring is replaced by two binary truncated polynomial rings . DBTRU has some advantages over NTRU in terms of security and performance. In this paper, we propose a polynomial-time linear algebra attack against the DBTRU cryptosystem, which can break DBTRU for all recommended parameter choices. The paper shows that the plaintext can be achieved in less than 1 s via the linear algebra attack on a single PC. |
| |
| Keywords: | DBTRU NTRU public key cryptosystem linear algebra attack lattice-based attacks |
|
|
