Knowledge Base
Elliptic-Curve Parameter
A

c2tnb239v3

Summary

Name:
c2tnb239v3
Long Name:
c2tnb239v3 elliptic curve (binary field GF(2^239))
Key size:
239 bits
Object identifier:
1.2.840.10045.3.0.13
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)
0x1238774666a67766d6676f778e676b66999176666e687666d8766c66a9f
Copy to clipboard
Coefficient (b)
0x6a941977ba9f6a435199acfc51067ed587f519c5ecb541b8e44111de1d40
Copy to clipboard
Generator (x)
0x70f6e9d04d289c4e89913ce3530bfde903977d42b146d539bf1bde4e9c92
Copy to clipboard
Generator (y)
0x2e5a0eaf6e5e1305b9004dce5c0ed7fe59a35608f33837c816d80b79f461
Copy to clipboard
Order (n)
0xcccccccccccccccccccccccccccccac4912d2d9df903ef9888b8a0e4cff
Copy to clipboard
Cofactor (h)
0xa
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 239;
\\ reduction polynomial: z^239 + z^36 + 1
a = 0x1238774666a67766d6676f778e676b66999176666e687666d8766c66a9f;
b = 0x6a941977ba9f6a435199acfc51067ed587f519c5ecb541b8e44111de1d40;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x70f6e9d04d289c4e89913ce3530bfde903977d42b146d539bf1bde4e9c92, 0x2e5a0eaf6e5e1305b9004dce5c0ed7fe59a35608f33837c816d80b79f461];
n = 0xcccccccccccccccccccccccccccccac4912d2d9df903ef9888b8a0e4cff;
h = 0xa;
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 &= 0x1238774666a67766d6676f778e676b66999176666e687666d8766c66a9f \\
b &= 0x6a941977ba9f6a435199acfc51067ed587f519c5ecb541b8e44111de1d40 \\
G &= (0x70f6e9d04d289c4e89913ce3530bfde903977d42b146d539bf1bde4e9c92, 0x2e5a0eaf6e5e1305b9004dce5c0ed7fe59a35608f33837c816d80b79f461) \\
n &= 0xcccccccccccccccccccccccccccccac4912d2d9df903ef9888b8a0e4cff \\
h &= 0xa
\end{aligned}$
Copy to clipboard