2024-12-07 19:21:57 +00:00
|
|
|
/*
|
|
|
|
* Centralised machinery for hybridised post-quantum + classical key
|
|
|
|
* exchange setups, using the same message structure as ECDH but the
|
|
|
|
* strings sent each way are the concatenation of a key or ciphertext
|
|
|
|
* of each type, and the output shared secret is obtained by hashing
|
|
|
|
* together both of the sub-methods' outputs.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
#include "putty.h"
|
|
|
|
#include "ssh.h"
|
|
|
|
#include "mpint.h"
|
|
|
|
|
|
|
|
/* ----------------------------------------------------------------------
|
|
|
|
* Common definitions between client and server sides.
|
|
|
|
*/
|
|
|
|
|
|
|
|
typedef struct hybrid_alg hybrid_alg;
|
|
|
|
|
|
|
|
struct hybrid_alg {
|
|
|
|
const ssh_hashalg *combining_hash;
|
|
|
|
const pq_kemalg *pq_alg;
|
|
|
|
const ssh_kex *classical_alg;
|
|
|
|
void (*reformat)(ptrlen input, BinarySink *output);
|
|
|
|
};
|
|
|
|
|
|
|
|
static char *hybrid_description(const ssh_kex *kex)
|
|
|
|
{
|
|
|
|
const struct hybrid_alg *alg = kex->extra;
|
|
|
|
|
|
|
|
/* Bit of a bodge, but think up a short name to describe the
|
|
|
|
* classical algorithm */
|
|
|
|
const char *classical_name;
|
|
|
|
if (alg->classical_alg == &ssh_ec_kex_curve25519)
|
|
|
|
classical_name = "Curve25519";
|
New post-quantum kex: ML-KEM, and three hybrids of it.
As standardised by NIST in FIPS 203, this is a lattice-based
post-quantum KEM.
Very vaguely, the idea of it is that your public key is a matrix A and
vector t, and the private key is the knowledge of how to decompose t
into two vectors with all their coefficients small, one transformed by
A relative to the other. Encryption of a binary secret starts by
turning each bit into one of two maximally separated residues mod a
prime q, and then adding 'noise' based on the public key in the form
of small increments and decrements mod q, again with some of the noise
transformed by A relative to the rest. Decryption uses the knowledge
of t's decomposition to align the two sets of noise so that the
_large_ changes (which masked the secret from an eavesdropper) cancel
out, leaving only a collection of small changes to the original secret
vector. Then the vector of input bits can be recovered by assuming
that those accumulated small pieces of noise haven't concentrated in
any particular residue enough to push it more than half way to the
other of its possible starting values.
A weird feature of it is that decryption is not a true mathematical
inverse of encryption. The assumption that the noise doesn't get large
enough to flip any bit of the secret is only probabilistically valid,
not a hard guarantee. In other words, key agreement can fail, simply
by getting particularly unlucky with the distribution of your random
noise! However, the probability of a failure is very low - less than
2^-138 even for ML-KEM-512, and gets even smaller with the larger
variants.
An awkward feature for our purposes is that the matrix A, containing a
large number of residues mod the prime q=3329, is required to be
constructed by a process of rejection sampling, i.e. generating random
12-bit values and throwing away the out-of-range ones. That would be a
real pain for our side-channel testing system, which generally handles
rejection sampling badly (since it necessarily involves data-dependent
control flow and timing variation). Fortunately, the matrix and the
random seed it was made from are both public: the matrix seed is
transmitted as part of the public key, so it's not necessary to try to
hide it. Accordingly, I was able to get the implementation to pass
testsc by means of not varying the matrix seed between runs, which is
justified by the principle of testsc that you vary the _secrets_ to
ensure timing is independent of them - and the matrix seed isn't a
secret, so you're allowed to keep it the same.
The three hybrid algorithms, defined by the current Internet-Draft
draft-kampanakis-curdle-ssh-pq-ke, include one hybrid of ML-KEM-768
with Curve25519 in exactly the same way we were already hybridising
NTRU Prime with Curve25519, and two more hybrids of ML-KEM with ECDH
over a NIST curve. The former hybrid interoperates with the
implementation in OpenSSH 9.9; all three interoperate with the fork
'openssh-oqs' at github.com/open-quantum-safe/openssh, and also with
the Python library AsyncSSH.
2024-12-07 19:33:39 +00:00
|
|
|
else if (alg->classical_alg == &ssh_ec_kex_nistp256)
|
|
|
|
classical_name = "NIST P256";
|
|
|
|
else if (alg->classical_alg == &ssh_ec_kex_nistp384)
|
|
|
|
classical_name = "NIST P384";
|
2024-12-07 19:21:57 +00:00
|
|
|
else
|
|
|
|
unreachable("don't have a name for this classical alg");
|
|
|
|
|
|
|
|
return dupprintf("%s / %s hybrid key exchange",
|
|
|
|
alg->pq_alg->description, classical_name);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void reformat_mpint_be(ptrlen input, BinarySink *output, size_t bytes)
|
|
|
|
{
|
|
|
|
BinarySource src[1];
|
|
|
|
BinarySource_BARE_INIT_PL(src, input);
|
|
|
|
mp_int *mp = get_mp_ssh2(src);
|
|
|
|
assert(!get_err(src));
|
|
|
|
assert(get_avail(src) == 0);
|
|
|
|
for (size_t i = bytes; i-- > 0 ;)
|
|
|
|
put_byte(output, mp_get_byte(mp, i));
|
|
|
|
mp_free(mp);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void reformat_mpint_be_32(ptrlen input, BinarySink *output)
|
|
|
|
{
|
|
|
|
reformat_mpint_be(input, output, 32);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void reformat_mpint_be_48(ptrlen input, BinarySink *output)
|
|
|
|
{
|
|
|
|
reformat_mpint_be(input, output, 48);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ----------------------------------------------------------------------
|
|
|
|
* Client side.
|
|
|
|
*/
|
|
|
|
|
|
|
|
typedef struct hybrid_client_state hybrid_client_state;
|
|
|
|
|
|
|
|
static const ecdh_keyalg hybrid_client_vt;
|
|
|
|
|
|
|
|
struct hybrid_client_state {
|
|
|
|
const hybrid_alg *alg;
|
|
|
|
strbuf *pq_ek;
|
|
|
|
pq_kem_dk *pq_dk;
|
|
|
|
ecdh_key *classical;
|
|
|
|
ecdh_key ek;
|
|
|
|
};
|
|
|
|
|
|
|
|
static ecdh_key *hybrid_client_new(const ssh_kex *kex, bool is_server)
|
|
|
|
{
|
|
|
|
assert(!is_server);
|
|
|
|
hybrid_client_state *s = snew(hybrid_client_state);
|
|
|
|
s->alg = kex->extra;
|
|
|
|
s->ek.vt = &hybrid_client_vt;
|
|
|
|
s->pq_ek = strbuf_new();
|
|
|
|
s->pq_dk = pq_kem_keygen(s->alg->pq_alg, BinarySink_UPCAST(s->pq_ek));
|
|
|
|
s->classical = ecdh_key_new(s->alg->classical_alg, is_server);
|
|
|
|
return &s->ek;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void hybrid_client_free(ecdh_key *ek)
|
|
|
|
{
|
|
|
|
hybrid_client_state *s = container_of(ek, hybrid_client_state, ek);
|
|
|
|
strbuf_free(s->pq_ek);
|
|
|
|
pq_kem_free_dk(s->pq_dk);
|
|
|
|
ecdh_key_free(s->classical);
|
|
|
|
sfree(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* In the client, getpublic is called first: we make up a KEM key
|
|
|
|
* pair, and send the public key along with a classical DH value.
|
|
|
|
*/
|
|
|
|
static void hybrid_client_getpublic(ecdh_key *ek, BinarySink *bs)
|
|
|
|
{
|
|
|
|
hybrid_client_state *s = container_of(ek, hybrid_client_state, ek);
|
|
|
|
put_datapl(bs, ptrlen_from_strbuf(s->pq_ek));
|
|
|
|
ecdh_key_getpublic(s->classical, bs);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* In the client, getkey is called second, after the server sends its
|
|
|
|
* response: we use our KEM private key to decapsulate the server's
|
|
|
|
* ciphertext.
|
|
|
|
*/
|
|
|
|
static bool hybrid_client_getkey(ecdh_key *ek, ptrlen remoteKey, BinarySink *bs)
|
|
|
|
{
|
|
|
|
hybrid_client_state *s = container_of(ek, hybrid_client_state, ek);
|
|
|
|
|
|
|
|
BinarySource src[1];
|
|
|
|
BinarySource_BARE_INIT_PL(src, remoteKey);
|
|
|
|
|
|
|
|
ssh_hash *h = ssh_hash_new(s->alg->combining_hash);
|
|
|
|
|
|
|
|
ptrlen pq_ciphertext = get_data(src, s->alg->pq_alg->c_len);
|
|
|
|
if (get_err(src)) {
|
|
|
|
ssh_hash_free(h);
|
|
|
|
return false; /* not enough data */
|
|
|
|
}
|
|
|
|
if (!pq_kem_decaps(s->pq_dk, BinarySink_UPCAST(h), pq_ciphertext)) {
|
|
|
|
ssh_hash_free(h);
|
|
|
|
return false; /* pq ciphertext didn't validate */
|
|
|
|
}
|
|
|
|
|
|
|
|
ptrlen classical_data = get_data(src, get_avail(src));
|
|
|
|
strbuf *classical_key = strbuf_new();
|
|
|
|
if (!ecdh_key_getkey(s->classical, classical_data,
|
|
|
|
BinarySink_UPCAST(classical_key))) {
|
|
|
|
ssh_hash_free(h);
|
|
|
|
return false; /* classical DH key didn't validate */
|
|
|
|
}
|
|
|
|
s->alg->reformat(ptrlen_from_strbuf(classical_key), BinarySink_UPCAST(h));
|
|
|
|
strbuf_free(classical_key);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Finish up: compute the final output hash and return it encoded
|
|
|
|
* as a string.
|
|
|
|
*/
|
|
|
|
unsigned char hashdata[MAX_HASH_LEN];
|
|
|
|
ssh_hash_final(h, hashdata);
|
|
|
|
put_stringpl(bs, make_ptrlen(hashdata, s->alg->combining_hash->hlen));
|
|
|
|
smemclr(hashdata, sizeof(hashdata));
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const ecdh_keyalg hybrid_client_vt = {
|
|
|
|
.new = hybrid_client_new, /* but normally the selector calls this */
|
|
|
|
.free = hybrid_client_free,
|
|
|
|
.getpublic = hybrid_client_getpublic,
|
|
|
|
.getkey = hybrid_client_getkey,
|
|
|
|
.description = hybrid_description,
|
2024-12-08 10:34:10 +00:00
|
|
|
.packet_naming_ctx = SSH2_PKTCTX_HYBRIDKEX,
|
2024-12-07 19:21:57 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* ----------------------------------------------------------------------
|
|
|
|
* Server side.
|
|
|
|
*/
|
|
|
|
|
|
|
|
typedef struct hybrid_server_state hybrid_server_state;
|
|
|
|
|
|
|
|
static const ecdh_keyalg hybrid_server_vt;
|
|
|
|
|
|
|
|
struct hybrid_server_state {
|
|
|
|
const hybrid_alg *alg;
|
|
|
|
strbuf *pq_ciphertext;
|
|
|
|
ecdh_key *classical;
|
|
|
|
ecdh_key ek;
|
|
|
|
};
|
|
|
|
|
|
|
|
static ecdh_key *hybrid_server_new(const ssh_kex *kex, bool is_server)
|
|
|
|
{
|
|
|
|
assert(is_server);
|
|
|
|
hybrid_server_state *s = snew(hybrid_server_state);
|
|
|
|
s->alg = kex->extra;
|
|
|
|
s->ek.vt = &hybrid_server_vt;
|
|
|
|
s->pq_ciphertext = strbuf_new_nm();
|
|
|
|
s->classical = ecdh_key_new(s->alg->classical_alg, is_server);
|
|
|
|
return &s->ek;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void hybrid_server_free(ecdh_key *ek)
|
|
|
|
{
|
|
|
|
hybrid_server_state *s = container_of(ek, hybrid_server_state, ek);
|
|
|
|
strbuf_free(s->pq_ciphertext);
|
|
|
|
ecdh_key_free(s->classical);
|
|
|
|
sfree(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* In the server, getkey is called first: we receive a KEM encryption
|
|
|
|
* key from the client and encapsulate a secret with it. We write the
|
|
|
|
* output secret to bs; the data we'll send to the client is saved to
|
|
|
|
* return from getpublic.
|
|
|
|
*/
|
|
|
|
static bool hybrid_server_getkey(ecdh_key *ek, ptrlen remoteKey, BinarySink *bs)
|
|
|
|
{
|
|
|
|
hybrid_server_state *s = container_of(ek, hybrid_server_state, ek);
|
|
|
|
|
|
|
|
BinarySource src[1];
|
|
|
|
BinarySource_BARE_INIT_PL(src, remoteKey);
|
|
|
|
|
|
|
|
ssh_hash *h = ssh_hash_new(s->alg->combining_hash);
|
|
|
|
|
|
|
|
ptrlen pq_ek = get_data(src, s->alg->pq_alg->ek_len);
|
|
|
|
if (get_err(src)) {
|
|
|
|
ssh_hash_free(h);
|
|
|
|
return false; /* not enough data */
|
|
|
|
}
|
|
|
|
if (!pq_kem_encaps(s->alg->pq_alg,
|
|
|
|
BinarySink_UPCAST(s->pq_ciphertext),
|
|
|
|
BinarySink_UPCAST(h), pq_ek)) {
|
|
|
|
ssh_hash_free(h);
|
|
|
|
return false; /* pq encryption key didn't validate */
|
|
|
|
}
|
|
|
|
|
|
|
|
ptrlen classical_data = get_data(src, get_avail(src));
|
|
|
|
strbuf *classical_key = strbuf_new();
|
|
|
|
if (!ecdh_key_getkey(s->classical, classical_data,
|
|
|
|
BinarySink_UPCAST(classical_key))) {
|
|
|
|
ssh_hash_free(h);
|
|
|
|
return false; /* classical DH key didn't validate */
|
|
|
|
}
|
|
|
|
s->alg->reformat(ptrlen_from_strbuf(classical_key), BinarySink_UPCAST(h));
|
|
|
|
strbuf_free(classical_key);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Finish up: compute the final output hash and return it encoded
|
|
|
|
* as a string.
|
|
|
|
*/
|
|
|
|
unsigned char hashdata[MAX_HASH_LEN];
|
|
|
|
ssh_hash_final(h, hashdata);
|
|
|
|
put_stringpl(bs, make_ptrlen(hashdata, s->alg->combining_hash->hlen));
|
|
|
|
smemclr(hashdata, sizeof(hashdata));
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void hybrid_server_getpublic(ecdh_key *ek, BinarySink *bs)
|
|
|
|
{
|
|
|
|
hybrid_server_state *s = container_of(ek, hybrid_server_state, ek);
|
|
|
|
put_datapl(bs, ptrlen_from_strbuf(s->pq_ciphertext));
|
|
|
|
ecdh_key_getpublic(s->classical, bs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const ecdh_keyalg hybrid_server_vt = {
|
|
|
|
.new = hybrid_server_new, /* but normally the selector calls this */
|
|
|
|
.free = hybrid_server_free,
|
|
|
|
.getkey = hybrid_server_getkey,
|
|
|
|
.getpublic = hybrid_server_getpublic,
|
|
|
|
.description = hybrid_description,
|
2024-12-08 10:34:10 +00:00
|
|
|
.packet_naming_ctx = SSH2_PKTCTX_HYBRIDKEX,
|
2024-12-07 19:21:57 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* ----------------------------------------------------------------------
|
|
|
|
* Selector vtable that instantiates the appropriate one of the above,
|
|
|
|
* depending on is_server.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static ecdh_key *hybrid_selector_new(const ssh_kex *kex, bool is_server)
|
|
|
|
{
|
|
|
|
if (is_server)
|
|
|
|
return hybrid_server_new(kex, is_server);
|
|
|
|
else
|
|
|
|
return hybrid_client_new(kex, is_server);
|
|
|
|
}
|
|
|
|
|
|
|
|
static const ecdh_keyalg hybrid_selector_vt = {
|
|
|
|
/* This is a never-instantiated vtable which only implements the
|
|
|
|
* functions that don't require an instance. */
|
|
|
|
.new = hybrid_selector_new,
|
|
|
|
.description = hybrid_description,
|
2024-12-08 10:34:10 +00:00
|
|
|
.packet_naming_ctx = SSH2_PKTCTX_HYBRIDKEX,
|
2024-12-07 19:21:57 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* ----------------------------------------------------------------------
|
|
|
|
* Actual KEX methods.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static const hybrid_alg ssh_ntru_curve25519_hybrid = {
|
|
|
|
.combining_hash = &ssh_sha512,
|
|
|
|
.pq_alg = &ssh_ntru,
|
|
|
|
.classical_alg = &ssh_ec_kex_curve25519,
|
|
|
|
.reformat = reformat_mpint_be_32,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex ssh_ntru_curve25519 = {
|
|
|
|
.name = "sntrup761x25519-sha512",
|
|
|
|
.main_type = KEXTYPE_ECDH,
|
|
|
|
.hash = &ssh_sha512,
|
|
|
|
.ecdh_vt = &hybrid_selector_vt,
|
|
|
|
.extra = &ssh_ntru_curve25519_hybrid,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex ssh_ntru_curve25519_openssh = {
|
|
|
|
.name = "sntrup761x25519-sha512@openssh.com",
|
|
|
|
.main_type = KEXTYPE_ECDH,
|
|
|
|
.hash = &ssh_sha512,
|
|
|
|
.ecdh_vt = &hybrid_selector_vt,
|
|
|
|
.extra = &ssh_ntru_curve25519_hybrid,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex *const ntru_hybrid_list[] = {
|
|
|
|
&ssh_ntru_curve25519,
|
|
|
|
&ssh_ntru_curve25519_openssh,
|
|
|
|
};
|
|
|
|
|
|
|
|
const ssh_kexes ssh_ntru_hybrid_kex = {
|
|
|
|
lenof(ntru_hybrid_list), ntru_hybrid_list,
|
|
|
|
};
|
New post-quantum kex: ML-KEM, and three hybrids of it.
As standardised by NIST in FIPS 203, this is a lattice-based
post-quantum KEM.
Very vaguely, the idea of it is that your public key is a matrix A and
vector t, and the private key is the knowledge of how to decompose t
into two vectors with all their coefficients small, one transformed by
A relative to the other. Encryption of a binary secret starts by
turning each bit into one of two maximally separated residues mod a
prime q, and then adding 'noise' based on the public key in the form
of small increments and decrements mod q, again with some of the noise
transformed by A relative to the rest. Decryption uses the knowledge
of t's decomposition to align the two sets of noise so that the
_large_ changes (which masked the secret from an eavesdropper) cancel
out, leaving only a collection of small changes to the original secret
vector. Then the vector of input bits can be recovered by assuming
that those accumulated small pieces of noise haven't concentrated in
any particular residue enough to push it more than half way to the
other of its possible starting values.
A weird feature of it is that decryption is not a true mathematical
inverse of encryption. The assumption that the noise doesn't get large
enough to flip any bit of the secret is only probabilistically valid,
not a hard guarantee. In other words, key agreement can fail, simply
by getting particularly unlucky with the distribution of your random
noise! However, the probability of a failure is very low - less than
2^-138 even for ML-KEM-512, and gets even smaller with the larger
variants.
An awkward feature for our purposes is that the matrix A, containing a
large number of residues mod the prime q=3329, is required to be
constructed by a process of rejection sampling, i.e. generating random
12-bit values and throwing away the out-of-range ones. That would be a
real pain for our side-channel testing system, which generally handles
rejection sampling badly (since it necessarily involves data-dependent
control flow and timing variation). Fortunately, the matrix and the
random seed it was made from are both public: the matrix seed is
transmitted as part of the public key, so it's not necessary to try to
hide it. Accordingly, I was able to get the implementation to pass
testsc by means of not varying the matrix seed between runs, which is
justified by the principle of testsc that you vary the _secrets_ to
ensure timing is independent of them - and the matrix seed isn't a
secret, so you're allowed to keep it the same.
The three hybrid algorithms, defined by the current Internet-Draft
draft-kampanakis-curdle-ssh-pq-ke, include one hybrid of ML-KEM-768
with Curve25519 in exactly the same way we were already hybridising
NTRU Prime with Curve25519, and two more hybrids of ML-KEM with ECDH
over a NIST curve. The former hybrid interoperates with the
implementation in OpenSSH 9.9; all three interoperate with the fork
'openssh-oqs' at github.com/open-quantum-safe/openssh, and also with
the Python library AsyncSSH.
2024-12-07 19:33:39 +00:00
|
|
|
|
|
|
|
static const hybrid_alg ssh_mlkem768_curve25519_hybrid = {
|
|
|
|
.combining_hash = &ssh_sha256,
|
|
|
|
.pq_alg = &ssh_mlkem768,
|
|
|
|
.classical_alg = &ssh_ec_kex_curve25519,
|
|
|
|
.reformat = reformat_mpint_be_32,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex ssh_mlkem768_curve25519 = {
|
|
|
|
.name = "mlkem768x25519-sha256",
|
|
|
|
.main_type = KEXTYPE_ECDH,
|
|
|
|
.hash = &ssh_sha256,
|
|
|
|
.ecdh_vt = &hybrid_selector_vt,
|
|
|
|
.extra = &ssh_mlkem768_curve25519_hybrid,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex *const mlkem_curve25519_hybrid_list[] = {
|
|
|
|
&ssh_mlkem768_curve25519,
|
|
|
|
};
|
|
|
|
|
|
|
|
const ssh_kexes ssh_mlkem_curve25519_hybrid_kex = {
|
|
|
|
lenof(mlkem_curve25519_hybrid_list), mlkem_curve25519_hybrid_list,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const hybrid_alg ssh_mlkem768_p256_hybrid = {
|
|
|
|
.combining_hash = &ssh_sha256,
|
|
|
|
.pq_alg = &ssh_mlkem768,
|
|
|
|
.classical_alg = &ssh_ec_kex_nistp256,
|
|
|
|
.reformat = reformat_mpint_be_32,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex ssh_mlkem768_p256 = {
|
|
|
|
.name = "mlkem768nistp256-sha256",
|
|
|
|
.main_type = KEXTYPE_ECDH,
|
|
|
|
.hash = &ssh_sha256,
|
|
|
|
.ecdh_vt = &hybrid_selector_vt,
|
|
|
|
.extra = &ssh_mlkem768_p256_hybrid,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const hybrid_alg ssh_mlkem1024_p384_hybrid = {
|
|
|
|
.combining_hash = &ssh_sha384,
|
|
|
|
.pq_alg = &ssh_mlkem1024,
|
|
|
|
.classical_alg = &ssh_ec_kex_nistp384,
|
|
|
|
.reformat = reformat_mpint_be_48,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex ssh_mlkem1024_p384 = {
|
|
|
|
.name = "mlkem1024nistp384-sha384",
|
|
|
|
.main_type = KEXTYPE_ECDH,
|
|
|
|
.hash = &ssh_sha384,
|
|
|
|
.ecdh_vt = &hybrid_selector_vt,
|
|
|
|
.extra = &ssh_mlkem1024_p384_hybrid,
|
|
|
|
};
|
|
|
|
|
|
|
|
static const ssh_kex *const mlkem_nist_hybrid_list[] = {
|
|
|
|
&ssh_mlkem1024_p384,
|
|
|
|
&ssh_mlkem768_p256,
|
|
|
|
};
|
|
|
|
|
|
|
|
const ssh_kexes ssh_mlkem_nist_hybrid_kex = {
|
|
|
|
lenof(mlkem_nist_hybrid_list), mlkem_nist_hybrid_list,
|
|
|
|
};
|