A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof against chosen messages attack has been made for this scheme. In this paper, we show that NTRUSign signature scheme contains the weakness of malleability. From this, one can derive new valid signatures from any previous...

RFID is a key technology that can be used to create the ubiquitous society. However, this technology may suffer from some serious threats such as privacy disclosure. In order to solve these secure problems we propose a strong mutual authentication protocol based on a lightweight public-key cryptosystem: NTRU. The protocol assures the confidentiality of the RFID system by encrypting the messages...

Identity-based encryption (IBE) is a special case of public-key encryption where user identities replace public keys. Every user is given a corresponding secret key for decryption, and encryptions for his or her identity must remain confidential even to attackers who learn the secret keys associated with other identities. Several IBE constructions are known to date, but their security relies on...

The advent of quantum computing with high processing capabilities will enable brute force attacks in short periods time, threatening current secure communication channels. To mitigate this situation, post-quantum cryptography (PQC) algorithms have emerged. Among the evaluated by NIST third round its PQC contest was NTRU cryptosystem. main drawback algorithm is enormous amount time required for ...

Fei Hu, Kyle Wilhelm, Michael Schab, Marcin Lukowiak, Stanislaw Radziszowski and Yang Xiao*y Department of Electrical and Computer Engineering, The University of Alabama, U.S.A. Department of Computer Engineering, RIT, Rochester, New York, U.S.A. Department of Computer Science, Rochester Institute of Technology, Rochester, New York, U.S.A. Department of Computer Science, University of Alabama, ...

Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. However, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. In this paper, we propose a general method to estimate lower...