Knowledge Base
Elliptic-Curve Parameter
A

c2tnb239v1

Summary

Name:
c2tnb239v1
Long Name:
c2tnb239v1 elliptic curve (binary field GF(2^239))
Key size:
239 bits
Object identifier:
1.2.840.10045.3.0.11
Publishers:

Check your host!

Type a URL to analyze a service

Get a prompt and clear overview of your security configuration. Right now!

Security

A+
Key Size
Security

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.

A+
Trusted Design
Security

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.

Recommendations

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.

A
Post-Quantum
Security

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.

Recommendations

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.

Parameter Numbers

Coefficient (a)
0x32010857077c5431123a46b808906756f543423e8d27877578125778ac76
Copy to clipboard
Coefficient (b)
0x790408f2eedaf392b012edefb3392f30f4327c0ca3f31fc383c422aa8c16
Copy to clipboard
Generator (x)
0x57927098fa932e7c0a96d3fd5b706ef7e5f5c156e16b7e7c86038552e91d
Copy to clipboard
Generator (y)
0x61d8ee5077c33fecf6f1a16b268de469c3c7744ea9a971649fc7a9616305
Copy to clipboard
Order (n)
0x2000000000000000000000000000000f4d42ffe1492a4993f1cad666e447
Copy to clipboard
Cofactor (h)
0x4
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
BggqhkjOPQMACw==
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

m = 239;
\\ reduction polynomial: z^239 + z^36 + 1
a = 0x32010857077c5431123a46b808906756f543423e8d27877578125778ac76;
b = 0x790408f2eedaf392b012edefb3392f30f4327c0ca3f31fc383c422aa8c16;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x57927098fa932e7c0a96d3fd5b706ef7e5f5c156e16b7e7c86038552e91d, 0x61d8ee5077c33fecf6f1a16b268de469c3c7744ea9a971649fc7a9616305];
n = 0x2000000000000000000000000000000f4d42ffe1492a4993f1cad666e447;
h = 0x4;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 + x y &= x^3 + a x^2 + b \pmod{f(z)} \\
f(z) &= z^{239} + z^{36} + 1 \\
a &= 0x32010857077c5431123a46b808906756f543423e8d27877578125778ac76 \\
b &= 0x790408f2eedaf392b012edefb3392f30f4327c0ca3f31fc383c422aa8c16 \\
G &= (0x57927098fa932e7c0a96d3fd5b706ef7e5f5c156e16b7e7c86038552e91d, 0x61d8ee5077c33fecf6f1a16b268de469c3c7744ea9a971649fc7a9616305) \\
n &= 0x2000000000000000000000000000000f4d42ffe1492a4993f1cad666e447 \\
h &= 0x4
\end{aligned}$
Copy to clipboard