Solving simultaneous modular equations of low degree
SIAM Journal on Computing - Special issue on cryptography
Analysis and Improvements of NTRU Encryption Paddings
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Dimension Reduction Methods for Convolution Modular Lattices
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Choosing NTRUEncrypt Parameters in Light of Combined Lattice Reduction and MITM Approaches
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Broadcast Attacks against Lattice-Based Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
New chosen-ciphertext attacks on NTRU
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A hybrid lattice-reduction and meet-in-the-middle attack against NTRU
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Recovering NTRU secret key from inversion oracles
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Flexible partial enlargement to accelerate gröbner basis computation over F2
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Hi-index | 0.00 |
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.