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----- MIGLAoGBAJV/vSQ/gR3sxcHZjrjh21KCvzpkz87BqRfsFuhJQl175H9VTqbLpAK+ uYrLVcBpdMA4zWVzr1vgYhoFzuyWk1iVcJ93o5Nza6wNNeXTa/5hMNCkjIAtpr0e yarRXsIkSWg5fHCsTDgAnARmdNw3/Aogw4JjONxRtVm4BcDfHyBjAgECAgIA4Q== -----END DH PARAMETERS-----
powermod(x, k, m) = lift(Mod(x, m) ^ k); g = 0x2; p = 0x957fbd243f811decc5c1d98eb8e1db5282bf3a64cfcec1a917ec16e849425d7be47f554ea6cba402beb98acb55c06974c038cd6573af5be0621a05ceec96935895709f77a393736bac0d35e5d36bfe6130d0a48c802da6bd1ec9aad15ec2244968397c70ac4c38009c046674dc37fc0a20c3826338dc51b559b805c0df1f2063; 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 0x957fbd243f811decc5c1d98eb8e1db5282bf3a64cfcec1a917ec16e849425d7be47f554ea6cba402beb98acb55c06974c038cd6573af5be0621a05ceec96935895709f77a393736bac0d35e5d36bfe6130d0a48c802da6bd1ec9aad15ec2244968397c70ac4c38009c046674dc37fc0a20c3826338dc51b559b805c0df1f2063 \\
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}$