Security of K(+)MVPKC Based on Indeterminate Simultaneous Equations - Along with Proposal of K(++)CBPKC

摘要

Formerly the author presented a message-dependent transformation scheme, K (I) Scheme [2-4]. Based on K(I)Scheme, the author presented a new class of CBPKC(Code Based PKC) [1-4], In this paper, we present a quadratic multi-variate PKC, referred to as K(+)MVPKC. We show that K(+)MVPKC would be secure against the various attacks such as Grobner basis (GB) attack, LLL attack. Namely the security of K(+)MVPKC depends on the difficulty of solving indeterminate 2k simultaneous quadratic equations in 3k variables (k > 88). In Appendix we present an augmented K(+)CBPKC.