The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity of Lattice Problems
Complexity of Lattice Problems
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
SIAM Journal on Computing
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
An Introduction to Mathematical Cryptography
An Introduction to Mathematical Cryptography
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
NTRU over rings beyond $${\mathbb{Z}}$$
Designs, Codes and Cryptography
MaTRU: a new NTRU-Based cryptosystem
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Symplectic lattice reduction and NTRU
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
The main purpose of this paper is to illustrate the fundamental concepts behind the NTRU public key cryptosystem can be extended to a broader algebra than Dedekind domains and the NTRU underlying ring may be replaced by a non-commutative or even nonassociative algebra. To cross the border of Dedekind or Euclidean domains, we prove that it is possible to extend NTRU to the algebra of polynomials with coefficients in the non-commutative ring of quaternions as well as the non-associative octonions algebra (a power-associative and alternative algebra of dimension eight over a principal ideal domain). We also demonstrate that the security of the proposed nonassociative cryptosystem relies on the intractability of shortest vector problem in a certain type of lattice. The least advantage of the non-associativity of the underlying algebra is that the resulting lattice is not fully classified under Convolutional Modular Lattice (CML). To the best of our knowledge, no non-associative public key cryptosystem based on non-associative algebra has been proposed in the literature.