Knowledge Base
Elliptic-Curve Parameter
A

c2pnb176w1

Summary

Name:
c2pnb176w1
Long Name:
c2pnb176w1 elliptic curve (binary field GF(2^176))
Key size:
176 bits
Object identifier:
1.2.840.10045.3.0.4
Publishers:
Aliases:
C2PNB176V1

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)
0xe4e6db2995065c407d9d39b8d0967b96704ba8e9c90b
Copy to clipboard
Coefficient (b)
0x5dda470abe6414de8ec133ae28e9bbd7fcec0ae0fff2
Copy to clipboard
Generator (x)
0x8d16c2866798b600f9f08bb4a8e860f3298ce04a5798
Copy to clipboard
Generator (y)
0x6fa4539c2dadddd6bab5167d61b436e1d92bb16a562c
Copy to clipboard
Order (n)
0x10092537397eca4f6145799d62b0a19ce06fe26ad
Copy to clipboard
Cofactor (h)
0xff6e
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 176;
\\ reduction polynomial: z^176 + z^43 + z^2 + z^1 + 1
a = 0xe4e6db2995065c407d9d39b8d0967b96704ba8e9c90b;
b = 0x5dda470abe6414de8ec133ae28e9bbd7fcec0ae0fff2;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x8d16c2866798b600f9f08bb4a8e860f3298ce04a5798, 0x6fa4539c2dadddd6bab5167d61b436e1d92bb16a562c];
n = 0x10092537397eca4f6145799d62b0a19ce06fe26ad;
h = 0xff6e;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 + x y &= x^3 + a x^2 + b \pmod{f(z)} \\
f(z) &= z^{176} + z^{43} + z^{2} + z^{1} + 1 \\
a &= 0xe4e6db2995065c407d9d39b8d0967b96704ba8e9c90b \\
b &= 0x5dda470abe6414de8ec133ae28e9bbd7fcec0ae0fff2 \\
G &= (0x8d16c2866798b600f9f08bb4a8e860f3298ce04a5798, 0x6fa4539c2dadddd6bab5167d61b436e1d92bb16a562c) \\
n &= 0x10092537397eca4f6145799d62b0a19ce06fe26ad \\
h &= 0xff6e
\end{aligned}$
Copy to clipboard