抄録
Cryptographic technology is essential to ensure reliability and security in today's advanced information society. In particular, the concept of public-key cryptography proposed by Diffie-Hemann in 1976 corresponds to the three elements of confidentiality, integrity, and availability. It is essential not only for the SSL that is currently used in electronic transactions on websites, but also for the construction of the authentication infrastructure (PKI) in the network society. Since the development of the RSA cryptosystem, several public cryptosystems have been proposed, and the security of many of the widely used cryptographic primitives, such as RSA and elliptic curve cryptography, lies in the fact that there is no way to decompose the product of two large primes in polynomial time. It has been pointed out that the use of quantum computers, which have been rapidly developed in recent years, breaks the security of prime factorization problems and causes serious problems in systems using them. In this paper, among post-quantum cryptography, which is said to be unbreakable even with a quantum computer in a practical time, we consider one using error-correcting code.
