Kemeleon Encodings

Introduction ML-KEM is a post-quantum key-encapsulation mechanism (KEM) recently standardized by NIST, Many applications are transitioning from classical Diffie-Hellman (DH) based solutions to constructions based on ML-KEM. The use of Elligator and related Hash-to-Curve algorithms are ubiquitous in DH-based protocols where DH shares are required to be encoded as, and look indistinguishable from, random bytestrings. For example, applications using Elligator include protocols used for censorship circumvention in Tor , password-authenticated key exchange (PAKE) protocols , and private set intersection (PSI) . For the post-quantum transition, an analogous encoding for (ML-)KEM public keys and ciphertexts to random bytestrings is required. This document specifies such an encoding, Kemeleon, for ML-KEM public keys and ciphertexts. Kemeleon was introduced in for building an (post-quantum) "obfuscated" KEM whose public keys and ciphertexts are indistinguishable from random. Beyond the original construction, this document additionally specifies variants that avoid the encoding failing or the use of large integer computations, or allow for a deterministic encoding. Aside from these variants, it is notable that the Kemeleon encodings of public keys results in smaller representations than in the original ML-KEM specification.

Conventions and Definitions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here.

Notation / ML-KEM Background A KEM consists of three algorithms:

KeyGen() -> (pk, sk): A probabilistic key generation algorithm that, with no input, generates a public key pk and a secret key sk.
Encaps(pk) -> (c, K): A probabilistic encapsulation algorithm that takes as input a public key pk, and outputs a ciphertext ct and shared secret key K.
Decaps(sk, c) -> K: A decapsulation algorithm that takes as input a secret key sk and ciphertext c, and outputs a shared secret key K.

The following variables and functions are adopted from :

q = 3329, n = 256
Compress_d : x -> round((2d/q)*x) mod 2d (Equation 4.7)
Decompress_d : y -> round((q/2d)*y) (Equation 4.8)
remaining parameters k, d_u, d_v, etc. are defined by the respective ML-KEM parameter set -- this document writes du and dv in place of d_u, d_v in pseudocode

ML-KEM.KeyGen() (Section 7.1 ) produces a public key, pk, (termed an encapsulation key in ) and a private key, sk, (decapsulation key). Public keys consist of byte-encoded vectors of coefficients in Z_q, where each coefficient is encoded in 12 bits, together with a 32-byte seed for generating the matrix A. ML-KEM.Encaps(pk) (Section 7.2 ) produces ciphertexts consisting of byte-encoded compressed vectors of cofficients, where each coefficient in Z_q is compressed by a certain number of bits (depending on the ML-KEM parameter set). The following terms and notation are used throughout this document:

msb(x) refers to the most significant bit of the value x
a[i] denotes the ith position of a vector a of coefficients
concat(x0, ..., xN): returns the concatenation of bytestrings.

Kemeleon Encoding At a high level, the constructions in this document instantiate the following functions:

EncodePk(pk) -> epk is the (possibly randomized) encoding algorithm that on input a public key, outputs an obfuscated public key or an error.
DecodePk(epk) -> pk is the deterministic decoding algorithm that on input an obfuscated public key, outputs a public key.
EncodeCtxt(c) -> ec is the (possibly randomized) encoding algorithm that on input a ciphertext, outputs an obfuscated ciphertext or an error.
DecodeCtxt(ec) -> c is the deterministic decoding algorithm that on input an obfuscated ciphertext, outputs a ciphertext.

Common Functions The following function maps a vector of k*n coefficients modulo q to a large integer, rejecting if the most significant bit of the integer is 1. The following algorithm samples an uncompressed pre-image of a coefficient c at random, where u is the decompressed value of c. The mapping is based on the Compress_d, Decompress_d algorithms from (Section 4.2.1 ).

Encoding Public Keys The following algorithms encode ML-KEM public keys as random bytestrings. rho is the public seed used to generate the public matrix A . This is already a random 32-byte string, so it is returned alongside the encoded value of t. t is a vector of k polynomials with n coefficients, but in the following pseudocode t is treated as a vector of k*n coefficients.

Encoding Ciphertexts ML-KEM ciphertexts consist of two components: c_1, a vector of k polynomials with n coefficients mod 2^du, and c_2, a polynomial with n coefficients mod 2^dv. The coefficients of these polynomials are not uniformly distributed, as a result of the compression step in encapsulation. The following encoding function decompresses and recovers a random preimage of this compression step in order to recover the uniform distribution of coefficients. Then, the same vector encoding step used for public keys is applied. For the second ciphertext component, rejection sampling is performed to retain uniformity, rather than decompressing.

Non-Rejection Sampling Variant Applying a technique from (Section 3.4), the original Kemeleon construction can be adapted to avoid rejection sampling. This results in larger output sizes, but the encoding algorithm never fails. Applying the technique from , where r is the encoded vector before rejection occurs in VectorEncode, we then choose m at random from [0,floor((2^(b+t)-r)/(q^(k*n)))], where b = log_2(q^(k*n)) and t is a security parameter, and return r + m*q^(k*n). This variant results in encoded values whose statistical distance from uniform is at most 2^-t. This results in an increased output size of t bits, where t is the security parameter. For example, with t=128, this increases the output size by 16 bytes. For public key encodings, one can immediately replace VectorEncode and VectorDecode calls with calls to the following algorithms. Notably, the random value m need not be transmitted alongside the encoded values. For ciphertext encodings, one must also avoid rejection sampling based on coefficients of the second component of the ciphertext. Therefore, the new ciphertext encoding must decompress and VectorEncodeNR the second component of the ciphertext. This more significantly increases the size of the encoded ciphertext.

Faster Arithmetic Variant [OPEN ISSUE: Is the faster variant of interest? If so, the following can be extended with a complete description.] Observing that q = 3329 = 13*2^8+1, a variant of Kemeleon with faster integer arithmetic can be specified. First, the encoding rejects any polynomial with a coefficient equal to q-1 = 3328. This ensures that all arithmetic can be computed with values modulo q-1 = 13*2^8. Then, note that rather than accumulating values to a large integer mod q^(k*n), it is only required to accumulate values to an integer mod 13^(k*n), while keeping track of the 8 lower order bits of each coefficient. The output size of the encoding does not change, but this results in an increased rejection rate. In particular, gives success probabilities for public key and ciphertext encodings: Success probabilities for faster Kemeleon encoding

Parameter	Pk success probability	Ctxt success probability
ML-KEM-512	0.49	0.45
ML-KEM-768	0.29	0.25
ML-KEM-1024	0.53	0.47

Deterministic Encoding The randomness used in Kemeleon ciphertext encodings MAY be derived in a deterministic manner. To do so, following a call to Encap which returns a KEM key K and a ciphertext c, the following steps can be taken:

Using a key derivation function (KDF), derive from the key K a new key K' and a seed for randomness rnd.
The seed rnd can be used to generate the randomness required when encoding the ciphertext c.
Use K' in place of K wherever applicable in the remainder of the protocol/system.
Upon any call to Decap, apply the same KDF to derive the new key K', as required.

Deriving a new KEM key for use in the remainder of a system is crucial in order to ensure key separation (i.e., not using the original key K to derive randomness and for other purposes). The randomness used to encode a public key MAY be stored alongside the corresponding secret key, if it is subsequently needed. See for relevant discussion on keeping this randomness secret.

Summary of Encodings Summary of Kemeleon Variants, NR = No Reject, FT = Faster

Algorithm / Parameter	Output size (bytes)	Success probability	Additional considerations
Kemeleon - ML-KEM512	pk: 781, ctxt: 877	pk: 0.56, ctxt: 0.51	Large int (750B) arithmetic
Kemeleon - ML-KEM768	pk: 1156, ctxt: 1252	pk: 0.83, ctxt: 0.77	Large int (1150B) arithmetic
Kemeleon - ML-KEM1024	pk: 1530, ctxt: 1658	pk: 0.62, ctxt: 0.57	Large int (1500B) arithmetic
KemeleonNR - ML-KEM512	pk: 797, ctxt: 1140	pk: 1.00, ctxt: 1.00	Large int (1123B) arithmetic
KemeleonNR - ML-KEM768	pk: 1172, ctxt: 1514	pk: 1.00, ctxt: 1.00	Large int (1498B) arithmetic
KemeleonNR - ML-KEM1024	pk: 1546, ctxt: 1889	pk: 1.00, ctxt: 1.00	Large int (1872B) arithmetic
KemeleonFT - ML-KEM512	pk: 781, ctxt: 877	pk: 0.49, ctxt: 0.45	Smaller int (235B) arithmetic
KemeleonFT - ML-KEM768	pk: 1156, ctxt: 1252	pk: 0.29, ctxt: 0.25	Smaller int (355B) arithmetic
KemeleonFT - ML-KEM1024	pk: 1530, ctxt: 1658	pk: 0.53, ctxt: 0.47	Smaller int (475B) arithmetic

Security Considerations This section contains additional security considerations about the Kemeleon encodings described in this document. In general, the obfuscation properties of the Kemeleon encodings depend on module LWE assumptions similar to those underlying the IND-CCA security of ML-KEM; see for the detailed security analysis of the original Kemeleon encoding.

Randomness Sampling Both public key and ciphertext encodings in the original Kemeleon encoding are randomized. The randomness (or seed used to generate randomness) used in Kemeleon encodings MUST be kept secret. In particular, public randomness enables distinguishing a Kemeleon-encoded value from a random bytestring: Decoding the value in question and re-encoding it with the public randomness will yield the original value if it was Kemeleon-encoded.

Timing Side-Channels Beyond timing side-channel considerations for ML-KEM itself, care should be taken when using Kemeleon encodings, in particular those with a non-zero failure probability. Rejecting and re-generating public keys or ciphertexts may leak information about the use of Kemeleon encodings, as might the overhead of the encoding itself.

IANA Considerations This document has no IANA actions.