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 GF(2)[x]/(xn+1). 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.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601391 | PMC |
| http://dx.doi.org/10.3390/e24101349 | DOI Listing |
Publication Analysis
Top Keywords
dbtru cryptosystem
8
linear algebra
8
algebra attack
8
dbtru
5
security analysis
4
analysis dbtru
4
cryptosystem dbtru
4
dbtru proposed
4
proposed thang
4
thang binh
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!