Security Analysis of DBTRU Cryptosystem

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 [Formula: see text]. DBTRU has some advantages over NTRU in terms of security and performance. In this paper, we propose a polynomial-time linear algeb...

Descripción completa

Detalles Bibliográficos
Autores principales: Tong, Xiaofei, Bi, Jingguo, Duan, Yufei, Li, Lixiang, Wang, Licheng
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601391/
https://www.ncbi.nlm.nih.gov/pubmed/37420368
http://dx.doi.org/10.3390/e24101349
Descripción
Sumario: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 [Formula: see text]. 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.

Ejemplares similares