New Public-Key Cipher System Based Upon the Diophantine Equations

A new public-key (two-key) cipher scheme is proposed in this paper. In our scheme, keys can be easily generated. In addition, both encryption and decryption procedures are simple. To encrypt a message, the sender needs to conduct a vector product of the message being sent and the enciphering key. On the other hand, the receiver can easily decrypt it by conducting several multiplication operations and modulus operations. For security analysis, we also examine some possible attacks on the presented scheme. >

[1]  Chin-Chen Chang,et al.  Pairwise Relatively Prime Generating Polynomials and Their Applications , 1989 .

[2]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[3]  Shih Ping Tung.  Complexity of Sentences Over Number Rings , 1991, SIAM J. Comput..

[4]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[5]  Shih Ping Tung,et al.  Computational Complexities of Diophantine Equations with Parameters , 1987, J. Algorithms.

[6]  Leonard M. Adleman,et al.  NP-Complete Decision Problems for Binary Quadratics , 1978, J. Comput. Syst. Sci..

[7]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  Adi Shamir.  Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems , 1983, Inf. Process. Lett..

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Julia Robinson,et al.  Reduction of an arbitrary diophantine equation to one in 13 unknowns , 1975 .

[13]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[14]  Eitan M. Gurari,et al.  An NP-complete number-theoretic problem , 1978, STOC '78.

[15]  Hugh C. Williams,et al.  A modification of the RSA public-key encryption procedure (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[16]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[17]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.