A new principle for constructing public-key cryptosystems and several new classes of public-key cryptosystems constructed based on the new principle

摘要

In this paper we propose a new method, referred to as K-method, for constructing the public-key cryptosystem. We show that, when this principle is applied over finite field, a new class of public-key cryptosystems based on multivariate polynomials is constructed. We further show that, when K-method is applied over integer ring, a new class of knap-sack type public key cryptosystems is constructed. We present several examples. One of the examples show that the size of the public-key is about 1/3 of the total size of the RSA's public-key, (n,e). One of the advantages of the constructed public-key cryptosystem is that the encryption and decryption can be performed very fast.