Get a prompt and clear overview of your security configuration. Right now!
The elliptic-curve cryptography[118][119][120][121] is an approach to public-key cryptography[164][165][166] based on the elliptic curve[116][117]s. The most important property in terms of encryption strength, beyond the designer is elliptic curve key size[292][293][294]. All the key sizes available are considered secure, so there is no consideration about it.
The elliptic-curve cryptography[118][119][120][121] is an approach to public-key cryptography[164][165][166] based on the elliptic curve[116][117]s. Note that there is controversy[287][288][289][290][291] around some of the National Institute of Standards and Technology[470][471] designed elliptic curveselliptic curves designed by NIST[285][286]. This elliptic curve designed by independent researcher[284] Daniel J. Bernstein[476][477] and there is no evidence for any compromise.
Add at least one elliptic curve to the list of elliptic curves supported by your server designed by independent researchers and prefer them as server configuration makes it possible.
The elliptic curve[116][117] cryptography provides no protection against a cryptanalytic attack by a quantum computer, and no classical elliptic curve does — just as classical Diffie-Hellman does not — 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.
p = 0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe1f; a = 0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe1e; d = 0x10bf7d; \\ curve: a*x^2 + y^2 = 1 + d*x^2*y^2 over GF(p) G = [0x2989e7fb43877bec2440935d5f92d631b11ceb33aae65658bc9539b326a7b4c2018740d09f0c1ebf8ab5b7d1faf15d7fd5d240b3cc01d587fc09d62f9c996efa, 0x4cabd08d4e8e78e8083878f475d5dfd251f468b21f3094fcd65c9a7955a4ae35aed2fda7b6186d4453fd4898f984e50ec0a42c5601fb1fc18383f64ff81d5835]; n = 0x1fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffea7c34182e41e2e9baa930e478c489b72542706bec5f32194f7c2e8f8d142f11; h = 0x4;
$\begin{aligned}
a x^2 + y^2 &\equiv 1 + d x^2 y^2 \pmod{p} \\
p &= 0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe1f \\
a &= 0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe1e \\
d &= 0x10bf7d \\
G &= (0x2989e7fb43877bec2440935d5f92d631b11ceb33aae65658bc9539b326a7b4c2018740d09f0c1ebf8ab5b7d1faf15d7fd5d240b3cc01d587fc09d62f9c996efa, 0x4cabd08d4e8e78e8083878f475d5dfd251f468b21f3094fcd65c9a7955a4ae35aed2fda7b6186d4453fd4898f984e50ec0a42c5601fb1fc18383f64ff81d5835) \\
n &= 0x1fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffea7c34182e41e2e9baa930e478c489b72542706bec5f32194f7c2e8f8d142f11 \\
h &= 0x4
\end{aligned}$