Knowledge Base
Elliptic-Curve Parameter
A

c2tnb191v3

Summary

Name:
c2tnb191v3
Long Name:
c2tnb191v3 elliptic curve (binary field GF(2^191))
Key size:
191 bits
Object identifier:
1.2.840.10045.3.0.7
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)
0x6c01074756099122221056911c77d77e77a777e7e7e77fcb
Copy to clipboard
Coefficient (b)
0x71fe1af926cf847989efef8db459f66394d90f32ad3f15e8
Copy to clipboard
Generator (x)
0x375d4ce24fde434489de8746e71786015009e66e38a926dd
Copy to clipboard
Generator (y)
0x545a39176196575d985999366e6ad34ce0a77cd7127b06be
Copy to clipboard
Order (n)
0x155555555555555555555555610c0b196812bfb6288a3ea3
Copy to clipboard
Cofactor (h)
0x6
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 191;
\\ reduction polynomial: z^191 + z^9 + 1
a = 0x6c01074756099122221056911c77d77e77a777e7e7e77fcb;
b = 0x71fe1af926cf847989efef8db459f66394d90f32ad3f15e8;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x375d4ce24fde434489de8746e71786015009e66e38a926dd, 0x545a39176196575d985999366e6ad34ce0a77cd7127b06be];
n = 0x155555555555555555555555610c0b196812bfb6288a3ea3;
h = 0x6;
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 &= 0x6c01074756099122221056911c77d77e77a777e7e7e77fcb \\
b &= 0x71fe1af926cf847989efef8db459f66394d90f32ad3f15e8 \\
G &= (0x375d4ce24fde434489de8746e71786015009e66e38a926dd, 0x545a39176196575d985999366e6ad34ce0a77cd7127b06be) \\
n &= 0x155555555555555555555555610c0b196812bfb6288a3ea3 \\
h &= 0x6
\end{aligned}$
Copy to clipboard