K-Matrix Public-Key Cryptosystems Constructed Based on Random Coding Technique - Along with a proporsal of new classes of SE(g)-PKC -

摘要

In this paper, we present a new class of public-key cryptosystem (PKC) over F^m. The proposed PKC is featured by a generator matrix, in a characteristic form, where the generator matrix of a random code over F_2m is used along with the generator matrix of a random code, as sub-matrices. This generator matrix, in the characteristic form, will be referred to as If-matrix. We show that the jftf-matrix yields the following advantages compared with the conventional schemes using error-control coding: (i) It realizes an abundant supply of PKCs, yielding more secure PKCs. (ii) It realizes a short public key. (iii) It makes possible to construct the cyphertexts of the coding rate of 0.94 ~ 0.99 for relatively short size of cyphertext. We also present new classes of SE(g)-VKQ in the Appendix.