A new lattice-based public-key cryptosystem mixed with a knapsack

Authors:
Yanbin Pan;Yingpu Deng;Yupeng Jiang;Ziran Tu
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;Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China;Henan University of Science and Technology, China
Venue:
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Year:
2011

Citing 23
Cited 0

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

Combinatorica
Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
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
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
Making NTRU as secure as worst-case problems over ideal lattices

EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Choosing parameter sets for NTRUEncrypt with NAEP and SVES-3

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
On ideal lattices and learning with errors over rings

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
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

In SAC'98, Cai and Cusick proposed an efficient lattice-based public-key cryptosystem mixed with a knapsack. However, a ciphertext-only attack given by Pan and Deng shows that it is not secure. In this paper, we present a new efficient lattice-based public-key cryptosystem mixed with a knapsack, which can resist Pan and Deng's attack well. What's more, it has reasonable key size, quick encryption and decryption. However, we have to point out that the new cryptosystem has no security proof.