In this paper a preliminary version of the NTRU signature scheme is cryptanalyzed. The attack exploits a correlation between some bits of a signature and coefficients of a secret random polynomial. The attack does not apply to the next version of the signature scheme.

This paper provides a self-contained introduction to elliptic and hyperelliptic curve cryptography and to the NTRU cryptosystem. The goal is to introduce the necessary mathematical background, detail various existing encryption and signature schemes and give an overview of the known security weaknesses.

Very recently, Ding proposed an ingenious algorithm to solve LWE problem with bounded errors in polynomial time. We find that it can be easily used to give a broadcast attack against NTRU, the most efficient lattice-based publickey cryptosystem known to date.

In order to prevent illegal tracking and stealing personal or cargo information, the authentication services should be provided for the tags to identify a Reader. A NTRU based signature scheme is proposed in this paper, which meets the demand for a group of tags to quickly and securely identify a Reader in RFID system. In our scheme, only the tag in specified group can verify the reader’s messa...

The article discusses the analysis of essence and protection possibilities Falcon post-quantum signature. main properties signature are considered. An estimate what resources computing power is required to use successfully A structural performed. GPV Rabina frameworks analyzed. Detailed conclusions made regarding conducted analyses. stability complexity Rabin evaluated, structures protocols the...