Abstract | ||
---|---|---|
In this paper, we propose an algebraic broadcast attack against NTRU, which recovers a single message encrypted multiple times using different NTRU public keys. Namely, when a message is broadcasted, under some reasonable assumptions, our attack can be completed in polynomial time and space. To the best of our knowledge, this is the first successful broadcast attack against NTRU. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-31448-3_10 | ACISP |
Keywords | Field | DocType |
successful broadcast attack,algebraic broadcast attack,reasonable assumption,single message,different ntru public key,polynomial time,multiple time,ntru | Broadcasting,NTRU,NTRUEncrypt,Algebraic number,Computer science,Theoretical computer science,Encryption,Time complexity,Public-key cryptography,Distributed computing | Conference |
Citations | PageRank | References |
3 | 0.44 | 16 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jintai Ding | 1 | 956 | 72.85 |
Yanbin Pan | 2 | 35 | 13.29 |
Yingpu Deng | 3 | 38 | 8.06 |