Get a prompt and clear overview of your security configuration. Right now!
1024
The Diffie-Hellman ephemeral public key parameter[409][410][411] with prime size less or equal than 1024-bit[424] is weakened against logjam attack[7][8][9][10], but can only be exploited by a national states.
Use a well-known Diffie-Hellman ephemeral public key parameter[426][427][428], or generate a custom Diffie-Hellman ephemeral public key parameter[409][410][411] with a size greater or equal than 2048 bits but less or equal than 4096 bits. In the case of custom parameters, validate that the prime is a safe prime[176] to avoid a small subgroup confinement attack[72][73].
False
The Diffie-Hellman[99][100][101][102][103] key exchange provides no protection against a cryptanalytic attack by a quantum computer, and no classical Diffie-Hellman does — just as no classical elliptic curve does — because a quantum computer breaks the hardness assumption they rely on. Only a hybrid key exchange (a classical algorithm combined with a post-quantum cryptography[158][159] one) or a pure post-quantum algorithm is quantum-safe.
Enable a hybrid key exchange or a pure post-quantum algorithm on your server, and prefer it where the configuration allows, so the connection stays secure against a future quantum computer.
-----BEGIN DH PARAMETERS----- MIGLAoGBALD+tM/UVQfnzIhZDRcmxQylSpIjgXjaiKpMEwa/XS+evJa4UQCdDA11 rf07sX5xTz+RVBREuDAlHOvfcpxM8YkNaD+UjqT7dokYspEWkAGZZoxTgU4nPZnn Wnqv1ezifvrtARjCeCVZBlw59s1JVK/BsepK+VPQ322v1JPnuq6bAgECAgIA4Q== -----END DH PARAMETERS-----
powermod(x, k, m) = lift(Mod(x, m) ^ k); g = 0x2; p = 0xb0feb4cfd45507e7cc88590d1726c50ca54a92238178da88aa4c1306bf5d2f9ebc96b851009d0c0d75adfd3bb17e714f3f91541444b830251cebdf729c4cf1890d683f948ea4fb768918b29116900199668c53814e273d99e75a7aafd5ece27efaed0118c2782559065c39f6cd4954afc1b1ea4af953d0df6dafd493e7baae9b; s = 256; a = 2 ^ (s - 1) + random(2 ^ (s - 1)); A = powermod(g, a, p); b = 2 ^ (s - 1) + random(2 ^ (s - 1)); B = powermod(g, b, p); S = powermod(B, a, p);
$\begin{eqnarray}
p \equiv 0xb0feb4cfd45507e7cc88590d1726c50ca54a92238178da88aa4c1306bf5d2f9ebc96b851009d0c0d75adfd3bb17e714f3f91541444b830251cebdf729c4cf1890d683f948ea4fb768918b29116900199668c53814e273d99e75a7aafd5ece27efaed0118c2782559065c39f6cd4954afc1b1ea4af953d0df6dafd493e7baae9b \\
g \equiv 0x2 \\
\\
a \in \mathbb{Z}_q \\
b \in \mathbb{Z}_q \\
\\
A \equiv g^a \pmod{p} \\
B \equiv g^b \pmod{p} \\
\\
S \equiv {(g^{a})}^{b}={(g^{b})}^{a}=g^{ab} \pmod{p}
\end{eqnarray}$