Public quadratic polynomial-tuples for efficient signature-verification and message-encryption
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Chosen-Ciphertext Attack against NTRU
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Analysis and Improvements of NTRU Encryption Paddings
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Key Recovery and Message Attacks on NTRU-Composite
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Variant of NTRU with Non-invertible Polynomials
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress 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
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Random small hamming weight products with applications to cryptography
Discrete Applied Mathematics - Special issue on the 2000 com2MaC workshop on cryptography
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Key recovery attacks on NTRU without ciphertext validation routine
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
NTRUSign: digital signatures using the NTRU lattice
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Algebraic Cryptanalysis of CTRU Cryptosystem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
NTRU over rings beyond $${\mathbb{Z}}$$
Designs, Codes and Cryptography
NTRU-like public key cryptosystems beyond dedekind domain up to alternative algebra
Transactions on computational science X
A general NTRU-Like framework for constructing lattice-based public-key cryptosystems
WISA'11 Proceedings of the 12th international conference on Information Security Applications
A non-associative lattice-based public key cryptosystem
Security and Communication Networks
| Hi-index | 0.00 |
In this paper, we propose a new variant of the NTRU public key cryptosystem – the MaTRU cryptosystem. MaTRU works under the same general principles as the NTRU cryptosystem, except that it operates in a different ring with a different linear transformation for encryption and decryption. In particular, it operates in the ring of k by k matrices of polynomials in R=ℤ[X]/(Xn−1), whereas NTRU operates in the ring ℤ[X]/(Xn−1). Note that an instance of MaTRU has the same number of bits per message as an instance of NTRU when nk2 = N. The improved efficiency of the linear transformation in MaTRU leads to respectable speed improvements by a factor of O(k) over NTRU at the cost of a somewhat larger public key.