A general NTRU-Like framework for constructing lattice-based public-key cryptosystems

Authors:
Yanbin Pan;Yingpu Deng
Affiliations:
Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China;Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China
Venue:
WISA'11 Proceedings of the 12th international conference on Information Security Applications
Year:
2011

Citing 21
Cited 0

On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica
Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A public-key cryptosystem with worst-case/average-case equivalence

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
A Lattice-Based Public-Key Cryptosystem

SAC '98 Proceedings of the Selected Areas in Cryptography
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Public-Key Cryptosystems from Lattice Reduction Problems

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Cryptanalysis of the Ajtai-Dwork Cryptosystem

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on 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
New lattice-based cryptographic constructions

Journal of the ACM (JACM)
On lattices, learning with errors, random linear codes, and cryptography

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Representing hard lattices with O(n log n) bits

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

Proceedings of the forty-first annual ACM symposium on Theory of computing
Lattice attacks on NTRU

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
A hybrid lattice-reduction and meet-in-the-middle attack against NTRU

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
MaTRU: a new NTRU-Based cryptosystem

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
A Ciphertext-Only Attack Against the Cai-Cusick Lattice-Based Public-Key Cryptosystem

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

As we know, one of the most difficult points of constructing a new public-key cryptosystem is to hide its trapdoor. By studying how NTRU hides its trapdoor, we present a general NTRU-like framework. The framework reduces constructing new lattice-based public-key cryptosystems to finding some certain kinds of easy closest vector problems (CVPs). We also show how to use the framework to reobtain NTRU. What's more, a new lattice-based public-key cryptosystem is proposed as an application of the framework.