Abstract
Since the proposal of the RSA cryptosystem as an implementation of public-key cryptography proposed by Diffie-Hemann in 1976, public key cryptosystems became the essential infrastructure to ensure three basic elements of information security such as confidentiality, integrity, and availability in today’s advanced information society. Not only RSA cryptosystem but also the system using elliptic or hyper-elliptic curves, their security depend on the difficulties of order counting problems in each field. However, the algorithm proposed on the quantum computer by Shor enables to solve these types of problem in polynomial time order operations and threaten the securities. Thus a cryptographic system that is expected to maintain security in consideration of currently known algorithms on quantum computers and future possibilities called Post-Quantum Computer Cryptography (PQCC) is required.
In this paper, among PQCC which is said to be unbreakable even with a quantum computer in a practical time, we consider one using self-dual error-correcting code over a integer module ring. We also refer to a decoding algorithm using Information set on the cryptosystem.
