The fundamental difference between Classic McEliece and RSA lies in the mathematical problem each relies on for security. RSA and its contemporaries (Diffie-Hellman, elliptic-curve cryptography) are based on number-theoretic problems like integer factorization and discrete logarithms — precisely the kind of problems that Shor's algorithm running on a sufficiently large quantum computer could efficiently solve .
Classic McEliece belongs to a different family: code-based cryptography. Its security rests on the hardness of decoding a general linear code, a problem that has been studied for decades and remains hard even for quantum computers . The algorithm works as follows:
While both algorithms date from the late 1970s, their security track records could not be more different. The McEliece system's design rationale notes that "RSA has suffered dramatic security losses, while the McEliece system has maintained a spectacular security track record unmatched by any other proposals for post-quantum encryption" . Classic McEliece is described as "the paramount conservative code-based encryption scheme" relying on a "minimal, well-studied security assumption"
.
The BSI has been recommending Classic McEliece since March 2020 as part of its Technical Guideline TR-02102-1, deeming the algorithm "cryptographically suitable for long-term confidentiality protection" when used with appropriate security parameters . The BSI's 2026 recommendation includes specific parameter sets such as mceliece460896, mceliece6688128, and mceliece8192128
. The BSI has also described Classic McEliece as one of the "most conservative choices from the BSI's point of view"
.
Industry sources also confirm BSI's endorsement: the Botan cryptography library documents that "Classic McEliece is endorsed by the German Federal Office for Information Security (BSI) for its conservative security assumptions" .
NIST considered Classic McEliece as a Round 4 candidate in its Post-Quantum Cryptography project . However, in March 2025, NIST selected HQC instead as the additional code-based KEM for standardization
. NIST's stated reasons: "Although it is widely regarded as secure, NIST does not yet anticipate it being widely used because of its large public key size" and cited "limited interest"
.
Nevertheless, NIST materials acknowledge Classic McEliece's strengths, noting that it offers "small ciphertext sizes, fast encapsulation/decapsulation" and that one NIST presenter described it as "the best option for protecting various other keys"
.
The Classic McEliece home page notes that the algorithm has "already seen significant deployment" . BSI's approach requires hybrid solutions (PQC plus classical) for post-quantum applications, a model that may influence how Classic McEliece gets deployed in practice
.
Classic McEliece's ISO adoption creates a second international standard path alongside NIST's PQC standards. While NIST selected HQC for its code-based KEM portfolio, the ISO path means Classic McEliece will have formal international recognition that could drive adoption in jurisdictions that follow ISO standards, particularly in Europe where BSI has been recommending it since 2020.
The key practical barrier remains public key size — roughly 260 KB to 1 MB depending on the security level . That is orders of magnitude larger than RSA keys typically used today, making Classic McEliece impractical for many common use cases. However, its small ciphertexts and fast encapsulation/decapsulation performance make it attractive for applications where public key size is less constrained
.
Classic McEliece is now an ISO standard, backed by the BSI and respected by NIST. Its code-based architecture offers a fundamentally different — and arguably more conservative — security model than RSA, at the cost of very large public keys. For organizations planning a post-quantum migration, Classic McEliece represents a high-security option, particularly for long-term data protection where key size is not the primary constraint.