An Extended Knapsack Public Key Cryptosystem

Xiao Ping Ji; Hai Bin Zhang; Bo Ying Wu; Guang Yu Li

doi:10.4028/www.scientific.net/AMM.441.678

Paper Titles

Windows High-Speed Drawing Technology Research
p.660

BOF Endpoint Prediction Based on Multi-Neural Network Model
p.666

Interference Image Edge Detection Based on Wavelet Packet for Laser Interferometer Hydrophone
p.670

A Non-Uniform Regional Partition Coding of One Dimension Signal and its Application
p.674

An Extended Knapsack Public Key Cryptosystem
p.678

Boundary Detection for Non-Ideal Iris Based on Gray Transform
p.682

Comparison of Rapid Extraction Algorithms of Major Colors
p.687

Efficient Indexing RDF Query Algorithm for Big Data
p.691

Method for CCD Edge Signal Processing
p.695

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 441An Extended Knapsack Public Key Cryptosystem

An Extended Knapsack Public Key Cryptosystem

Abstract:

We analyzed a typical cryptosystem and an easy extended knapsack subset sum problem is proposed. The solution is not chosen from any longer but from. Based on the problem, we construct a public key cryptosystem in which the plaintext is divided into some groups and each group has bits, so that the encryption and decryption can be very fast. The possible attacks are analyzed. Our cryptosystem not only can resist Shamir's attack but also can resist the low density attack, because of its high density. The number of the sequence is also much shorter than before with the same density.

You might also be interested in these eBooks

Machinery Electronics and Control Engineering III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 441)

Pages:

678-681

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.441.678

Citation:

Cite this paper

Online since:

December 2013

Authors:

Xiao Ping Ji, Hai Bin Zhang, Bo Ying Wu, Guang Yu Li

Keywords:

Extended Knapsack, Low Density Attack, Public Key Cryptosystem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] W.P. Shor: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, Proc. the 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, p.124–134 (quant-ph/9508027), Nov. (1994).

DOI: 10.1109/sfcs.1994.365700

Google Scholar

[2] R. C. Merkle and M. E. Hellman: Hiding information and signatures in trapdoor knapsacks, IEEE Trans. Inf. Theory IT-24(5), p.525–530, Sept. (1978).

DOI: 10.1109/tit.1978.1055927

Google Scholar

[3] A. Shamir: A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystems, Proc. Crypto'82 LNCS, p.279–288, Springer-Verlag, Berlin, (1982).

DOI: 10.1007/978-1-4757-0602-4_27

Google Scholar

[4] J.C. Lagarias andA.M. Odlyzko: Solving low-density subset sum problems,J. Ass. Comput. Mathvol. 32, no. 1, pp.229-246, Jan. (1985).

DOI: 10.1145/2455.2461

Google Scholar

[5] M.J. Coster, A. Joux, B.A. La, Macchia, A.M. Odlyzko, C.P. Schnorr and J. Stern: An improved lowdensity subset sum algorithm, Computationmal Complexity, (1992), vol. 2, pp.97-186.

DOI: 10.1007/bf01201999

Google Scholar

[6] B. Chor and R.L. Rivest: A knapsack-type public key cryptosystem based on arithmetic in finite fields, IEEE Trans. Inform. Theory, 34, (1988).

DOI: 10.1109/18.21214

Google Scholar

[7] S. Vaudenay: Cryptanalysis of the Chor-Rivest Cryptosystem, In Journal of Cryptology, (2001), vol. 14, pp.87-100.

DOI: 10.1007/s001450010005

Google Scholar

[8] Weidong Zhang, Baocang Wang and Yupu Hu: A New Knapsack Public-Key Cryptosystem, Fifth International Conference on Information Assurance and Security, (2009), pp.53-56.

DOI: 10.1109/ias.2009.300

Google Scholar

[9] K. Kobayashi, K. Tadaki,M. Kasahara and S. Tsujii: A knapsack cryptosystem based on multiple knapsacks, International Symposium on Information Theory and its Applications, (2010), pp.428-432.

DOI: 10.1109/isita.2010.5649307

Google Scholar