# HqcLethe: Streaming HQC Encapsulation for Tiny Stateless Servers

DevFeed: [HqcLethe: Streaming HQC Encapsulation for Tiny Stateless Servers](<https://devfeed.tech/articles/hqclethe-streaming-hqc-encapsulation-for-tiny-stateless-servers-103368.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.36808>)

Author: Wind Wong, Klaus v. Gleissenthall

Published: 2026-10-28T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Post-quantum cryptography](<https://devfeed.tech/topics/post-quantum-cryptography.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [stateless](<https://devfeed.tech/topics/stateless.md>)

Tags: [authentication](<https://devfeed.tech/tags/authentication.md>), [client](<https://devfeed.tech/tags/client.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [fixed](<https://devfeed.tech/tags/fixed.md>), [handshake](<https://devfeed.tech/tags/handshake.md>), [hedge](<https://devfeed.tech/tags/hedge.md>), [independent](<https://devfeed.tech/tags/independent.md>), [lattice](<https://devfeed.tech/tags/lattice.md>), [masks](<https://devfeed.tech/tags/masks.md>), [memory](<https://devfeed.tech/tags/memory.md>), [nist](<https://devfeed.tech/tags/nist.md>), [packet](<https://devfeed.tech/tags/packet.md>), [packets](<https://devfeed.tech/tags/packets.md>), [pi](<https://devfeed.tech/tags/pi.md>), [post-quantum](<https://devfeed.tech/tags/post-quantum.md>), [puzzles](<https://devfeed.tech/tags/puzzles.md>), [raspberry-pi](<https://devfeed.tech/tags/raspberry-pi.md>), [servers](<https://devfeed.tech/tags/servers.md>), [stateless](<https://devfeed.tech/tags/stateless.md>), [streaming](<https://devfeed.tech/tags/streaming.md>)

## AI overview

HqcLethe streams an HQC encapsulation in packet-sized pieces, enabling a stateless post-quantum key exchange without buffering multi-packet handshakes. It uses the Chinese remainder theorem to split cyclic polynomial multiplication into per-packet remainders and masks them so they reveal no more than an ordinary HQC ciphertext; the authors report proving this in Rocq with SSProve and verifying session secrecy, server authentication, and forward secrecy in ProVerif. Client puzzles bound CPU exhaustion, while each worker used a fixed 1.2-1.6 MiB on a Raspberry Pi 3B+. At category 5, the abstract reports 27 times fewer bytes and 9 times less server CPU than McTiny.

## Source excerpt

arXiv:2610.36808v1 Announce Type: new Abstract: Stateless post-quantum authenticated key exchanges such as post-quantum WireGuard hedge against unexpected cryptanalytic advances by combining a lattice KEM with code-based Classic McEliece. However, recent attacks have led Germany's BSI to advise against McEliece, which leaves these protocols with lattices alone. HQC, the code-based KEM that NIST selected, could restore diversity, but its keys do not fit in a single packet, so a server would have to buffer multi-packet handshakes. This would leave an attack surface for memory exhaustion, which is what WireGuard's stateless handshake was designed to avoid in the first place. McTiny demonstrated that stateless key encapsulation for Classic McEliece is possible by streaming key blocks one-at-a-time. However, HQC's encapsulation does not split as easily into individual packets, as cyclic polynomial multiplication, unlike matrix-vector multiplication, is inherently non-local. We present HqcLethe, a stateless key exchange that streams an HQC encapsulation in packet-sized pieces. It uses the Chinese remainder theorem to split the polynomial multiplication into independent remainders, one per packet, and masks them so that they reveal no more than an ordinary HQC ciphertext, which we prove in Rocq with SSProve; we also verify session secrecy, server authentication and forward secrecy in ProVerif. Client puzzles bound CPU exhaustion, and HqcLethe removes memory exhaustion: on a Raspberry Pi 3B+, each worker runs in a fixed 1.2-1.6 MiB. At category 5 it sends 27x fewer bytes and uses 9.0x less server CPU than McTiny, the earlier stateless code-based design.