Abstract
In this article we present a lattice attack done on a NTRU-like scheme introduced by Verkhovsky in [1]. We show how, based on the relation between the public and private key, we can construct an attack which allows any passive adversary to decrypt the encrypted messages. We explain, step by step, how an attacker can construct an equivalent private key and guess what the original plaintext was. Our attack is efficient and provides good experimental results.
Highlights
Lattice-based cryptography has become a research topic more and more studied nowadays
In this article we present a lattice attack done on a NTRU-like scheme introduced by Verkhovsky in [1]
There are several lattice attacks [2,3] done on NTRU [4]
Summary
Lattice-based cryptography has become a research topic more and more studied nowadays. It may offer a good alternative to cryptographic schemes based on classical number-theory problems (e.g. discrete logarithm, factorization) that are solved on quantum computers. Lattices have proven to provide securely hard problems on which we can build cryptographic schemes and good tools for cryptanalysis. There are several lattice attacks [2,3] done on NTRU [4]. The main tool of these attacks is the LLL algorithm [5]. In order to overcome this, there are variants of NTRU which base their security on lattice hard problems [6]. In this article we present a lattice attack done on a NTRU-like scheme introduced by Verkhovsky in [1]. Our attack is efficient and provides good experimental results
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
