Fast decodable PKC, K_F(XVI)SE(1)PKC realizing coding rate of exactly 1.0, constructed based on cyclic code over F_2

摘要

In this paper we present a very fast decodable code-based PKC constructed based on the cyclic code over F_2, referred to as K_F(XVI)SE(1)PKC. The proposed K_F(XVI)SE(1)PKC has the following remarkable features: (i) using a most fundamental algebraic code, cyclic code over F_2, (ii) realizing coding rate of exactly 1.0, (iii) Grobner base attack cannot be applied due to a formidable computational cost, thanks to K(AIII)Scheme formerly presented by the author [1] [2], (iv)for number of message n ≥ 160, exhasustive type attack cannot be applied practically, (v)size of public key is 6KB for n = 160, smaller than that of McEliece PKC, n = 512(recommended value), by a factor of 10. (vi) high processing seed expected to be as fast as the conventional common key cryptosystem.