Knowledge Base
Elliptic-Curve Parameter
A

c2pnb208w1

Summary

Name:
c2pnb208w1
Long Name:
c2pnb208w1 elliptic curve (binary field GF(2^208))
Key size:
208 bits
Object identifier:
1.2.840.10045.3.0.10
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)
0x0
Copy to clipboard
Coefficient (b)
0xc8619ed45a62e6212e1160349e2bfa844439fafc2a3fd1638f9e
Copy to clipboard
Generator (x)
0x89fdfbe4abe193df9559ecf07ac0ce78554e2784eb8c1ed1a57a
Copy to clipboard
Generator (y)
0xf55b51a06e78e9ac38a035ff520d8b01781beb1a6bb08617de3
Copy to clipboard
Order (n)
0x101baf95c9723c57b6c21da2eff2d5ed588bdd5717e212f9d
Copy to clipboard
Cofactor (h)
0xfe48
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 208;
\\ reduction polynomial: z^208 + z^83 + z^2 + z^1 + 1
a = 0x0;
b = 0xc8619ed45a62e6212e1160349e2bfa844439fafc2a3fd1638f9e;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x89fdfbe4abe193df9559ecf07ac0ce78554e2784eb8c1ed1a57a, 0xf55b51a06e78e9ac38a035ff520d8b01781beb1a6bb08617de3];
n = 0x101baf95c9723c57b6c21da2eff2d5ed588bdd5717e212f9d;
h = 0xfe48;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 + x y &= x^3 + a x^2 + b \pmod{f(z)} \\
f(z) &= z^{208} + z^{83} + z^{2} + z^{1} + 1 \\
a &= 0x0 \\
b &= 0xc8619ed45a62e6212e1160349e2bfa844439fafc2a3fd1638f9e \\
G &= (0x89fdfbe4abe193df9559ecf07ac0ce78554e2784eb8c1ed1a57a, 0xf55b51a06e78e9ac38a035ff520d8b01781beb1a6bb08617de3) \\
n &= 0x101baf95c9723c57b6c21da2eff2d5ed588bdd5717e212f9d \\
h &= 0xfe48
\end{aligned}$
Copy to clipboard