Skip to main content
Lattice Encryption Questions Your Team Is AskingCryptography Fundamentals
5 min readFor Payment Security Engineers

Lattice Encryption Questions Your Team Is Asking

You're evaluating post-quantum cryptography for your payment infrastructure. Your team has read about NTRU, ML-KEM, and lattice-based schemes. Now they're asking practical questions in Slack: "Will this fit in our message size limits?" "What's the performance hit?" "Can we actually deploy this?"

These questions arise from a real tension. Post-quantum encryption schemes are larger and slower than the RSA and elliptic curve systems you're replacing. Your transaction messages have fixed size constraints, and your HSMs have processing budgets. Recent research into NTRU compactness offers new options, but the trade-offs aren't obvious from the papers.

Here are the most common questions, with direct answers.

Does Ciphertext Size Matter for Payment Systems?

Yes, and it compounds fast.

Every encrypted transaction carries ciphertext overhead. If you're processing 10,000 transactions per second, a 384-byte ciphertext versus a 768-byte ciphertext means 3.84 GB/s versus 7.68 GB/s of encryption overhead alone. That difference impacts your network capacity, storage costs, and HSM throughput budget.

For card-present transactions using Point-to-Point Encryption (P2PE), you're often working within ISO 8583 message size limits. A ciphertext that's 384 bytes instead of 768 bytes might mean fitting encryption into existing message formats or needing to redesign your entire transaction flow.

The recent END scheme achieves exactly this: a 384-byte ciphertext at NIST security level I, half the size of ML-KEM-512's 768-byte ciphertext. This isn't just theoretical; it's the difference between "we can deploy this" and "we need to rewrite our message handlers."

What's the Performance Cost of Going Smaller?

About 3% slower in the reference implementation for END-512 compared to ML-KEM-512.

That's the combined encapsulation and decapsulation time. You're cutting ciphertext size in half and paying a 3% performance penalty. For most payment architectures, that's an acceptable trade. Your bottleneck is rarely the cryptographic operation itself; it's usually network I/O, database queries, or fraud scoring.

The technique enabling this is Free Candidate Localization (FCL). Instead of directly computing the decryption, FCL ranks coordinates by their proximity to decision boundaries and constructs a small candidate set. The decoder then verifies candidates. This adds computational work but enables smaller ciphertexts because you can tolerate more noise in the encrypted message.

When FCL was applied to ML-KEM, it achieved a 10% smaller ciphertext at the cost of 5% slower runtime. Different schemes have different trade-off curves.

How Do I Choose Between "NTRU with Encoding" and "NTRU with Trapdoor"?

It depends on whether you value public key size or verification speed.

NTRU with Encoding uses algebraic structure through auxiliary quotient rings. The decoder verifies candidates using algebraic redundancy. This approach tends to have smaller public keys but larger verification costs.

NTRU with Trapdoor exploits the geometric structure of the NTRU trapdoor and verifies candidates using distributional tests. This typically yields smaller total sizes (public key plus ciphertext) but requires more sophisticated implementation.

At NIST-I security level, the encoding frontier yields a total public key plus ciphertext size of 812 bytes. The trapdoor frontier yields 754 bytes, which is 21% smaller than the previous lowest size of 964 bytes in DAWN.

For payment HSMs where you're storing thousands of public keys and processing millions of transactions, that 754-byte total matters. For key exchange in TLS-like protocols where you're sending both public key and ciphertext in a handshake, the trapdoor approach wins.

What Security Level Should I Target?

NIST-I is the practical minimum for financial systems.

NIST-I corresponds to the security of AES-128. That's the baseline for protecting Cardholder Data under current PCI DSS requirements. You might consider NIST-III (AES-192 equivalent) or NIST-V (AES-256 equivalent) for long-term key storage or regulatory reasons, but those levels come with proportionally larger keys and ciphertexts.

The compactness research focuses on NIST-I because that's where the size constraints are tightest. If you can't fit NIST-I encryption into your message formats, you definitely can't fit NIST-III.

All the numbers I've cited (384-byte ciphertexts, 754-byte totals) are at NIST-I. Scale up accordingly if your risk assessment demands higher security levels.

Should I Wait for These Schemes to Be Standardized?

That depends on your deployment timeline.

ML-KEM is already standardized (NIST FIPS 203). If you need to deploy post-quantum encryption in the next 12 months, use ML-KEM-512 or ML-KEM-768. The ecosystem support is there, the implementations are audited, and compliance frameworks recognize it.

Schemes like END are research prototypes. They demonstrate what's possible, but they haven't been through the standardization process. You're looking at a 2-5 year timeline before these appear in NIST standards or industry specifications.

However, understanding the compactness frontiers helps you plan capacity. If you're designing a new payment platform today, knowing that ciphertexts might eventually be 384 bytes instead of 768 bytes affects your message format decisions. Design with headroom for ML-KEM now, but don't hard-code assumptions that prevent you from adopting more compact schemes later.

What's the Failure Mode if I Push Compactness Too Far?

Decryption failures.

Lattice-based encryption schemes have a small probability that decryption produces the wrong plaintext. This happens when noise in the ciphertext exceeds what the decoder can correct. As you make ciphertexts more compact, you're allowing more noise, which increases the decryption failure probability.

For payment systems, a decryption failure means a declined transaction. If your failure rate is 2^-64, that's one failure in 18 quintillion operations, which is acceptable. If you're pushing compactness to the point where failures occur every billion transactions, you'll see customer-facing declines that look like system errors.

The research schemes target failure probabilities below 2^-128. That's vanishingly small. But if you're implementing these yourself or tuning parameters, test your decryption failure rate under load before you deploy.

Where Should I Go for Implementation Guidance?

Start with the reference implementations in the research papers, but don't deploy them directly to production.

The END reference implementation is available as part of the research publication. It demonstrates the techniques and provides performance benchmarks. Use it to understand the approach and validate that the compactness gains are real in your environment.

For production deployment, you need implementations that have been audited for side-channel resistance, constant-time operation, and integration with your HSM or cryptographic library. Work with your cryptographic vendor to understand their post-quantum roadmap and whether they're tracking these compactness improvements.

The NIST Post-Quantum Cryptography standardization project remains your authoritative source for what's ready for deployment. The compactness research tells you what's coming, not what to deploy today.

You Might Also Like