A Note on Security of KMN PKC

In this paper we describe the KMN PKC and the special class of it. KMN PKC has the feature that, two sequences are used as the public keys. We discuss on the security of KMN PKC against the low-density attack with computer experiments.

1 Introduction

Various important studies have been made of the Public-Key Cryptosystem (PKC). The security of the PKC's proposed so far, in most cases, depends on the difficulty of discrete logarithm problem or factoring problem. For this reason, it is desired to investigate another classes of PKC's that do not rely on the difficulty of those two problems.