Self-dual Code based PQCC and Critical Issues for Implementation

Abstract

In recent years, there have been many news reports about quantum computers, some of which suggest that they are nearing the practical stage, such as Google researchers achieving quantum supremacy and IBM’s development of a quantum processor with over 1,000 qubits. In the field of information security, it is believed that if order calculation algorithms based on Shor’s algorithm were put into practical use on quantum computers with a sufficient number of bits, many public key cryptosystems would be at risk. In response to such a situation, quantum communication cryptography systems that utilize the physical properties of quantum have been gaining attention, but Post Quantum Computer Cryptography (PQCC) based on current computer systems has also been proposed. NIST launched a public call for proposals related to PQC (or PQCC) with a deadline of November 2017, and approximately 69 algorithms and systems were proposed in several fields. As of March 2025, five algorithms remain in the fourth round of selection. In this paper, we propose a method using self-dual code based on the idea of one of these, the Classical McEliece algorithm, and provide critical issues in implementing for its implementation.