Knowledge Base
Elliptic-Curve Parameter
A

c2tnb191v1

Summary

Name:
c2tnb191v1
Long Name:
c2tnb191v1 elliptic curve (binary field GF(2^191))
Key size:
191 bits
Object identifier:
1.2.840.10045.3.0.5
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)
0x2866537b676752636a68f56554e12640276b649ef7526267
Copy to clipboard
Coefficient (b)
0x2e45ef571f00786f67b0081b9495a3d95462f5de0aa185ec
Copy to clipboard
Generator (x)
0x36b3daf8a23206f9c4f299d7b21a9c369137f2c84ae1aa0d
Copy to clipboard
Generator (y)
0x765be73433b3f95e332932e70ea245ca2418ea0ef98018fb
Copy to clipboard
Order (n)
0x40000000000000000000000004a20e90c39067c893bbb9a5
Copy to clipboard
Cofactor (h)
0x2
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 191;
\\ reduction polynomial: z^191 + z^9 + 1
a = 0x2866537b676752636a68f56554e12640276b649ef7526267;
b = 0x2e45ef571f00786f67b0081b9495a3d95462f5de0aa185ec;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x36b3daf8a23206f9c4f299d7b21a9c369137f2c84ae1aa0d, 0x765be73433b3f95e332932e70ea245ca2418ea0ef98018fb];
n = 0x40000000000000000000000004a20e90c39067c893bbb9a5;
h = 0x2;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 + x y &= x^3 + a x^2 + b \pmod{f(z)} \\
f(z) &= z^{191} + z^{9} + 1 \\
a &= 0x2866537b676752636a68f56554e12640276b649ef7526267 \\
b &= 0x2e45ef571f00786f67b0081b9495a3d95462f5de0aa185ec \\
G &= (0x36b3daf8a23206f9c4f299d7b21a9c369137f2c84ae1aa0d, 0x765be73433b3f95e332932e70ea245ca2418ea0ef98018fb) \\
n &= 0x40000000000000000000000004a20e90c39067c893bbb9a5 \\
h &= 0x2
\end{aligned}$
Copy to clipboard