This article discusses the vulnerability of elliptic-curve cryptography (ECC) to polynomial-time attacks by quantum computing. It suggests the use of post-quantum cryptography methods like the McEliece-Chen (PQCMC) to counter these threats. The proposed method is based on an efficient random invertible matrix generation method to issue pseudonymous certificates. The study includes mathematical models, security evaluations, and discussions, showing that distinct implicit certificates can be linked to the same end entity. It also compares certificate length and computation time to evaluate the performance of the proposed PQCMC.
Publication date: 26 Jan 2024
Project Page: Not Provided
Paper: https://arxiv.org/pdf/2401.13691
