Knowledge Base
Elliptic-Curve Parameter
A

c2pnb163v3

Summary

Name:
c2pnb163v3
Long Name:
c2pnb163v3 elliptic curve (binary field GF(2^163))
Key size:
163 bits
Object identifier:
1.2.840.10045.3.0.3
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)
0x7a526c63d3e25a256a007699f5447e32ae456b50e
Copy to clipboard
Coefficient (b)
0x3f7061798eb99e238fd6f1bf95b48feeb4854252b
Copy to clipboard
Generator (x)
0x2f9f87b7c574d0bdecf8a22e6524775f98cdebdcb
Copy to clipboard
Generator (y)
0x5b935590c155e17ea48eb3ff3718b893df59a05d0
Copy to clipboard
Order (n)
0x3fffffffffffffffffffe1aee140f110aff961309
Copy to clipboard
Cofactor (h)
0x2
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 163;
\\ reduction polynomial: z^163 + z^8 + z^2 + z^1 + 1
a = 0x7a526c63d3e25a256a007699f5447e32ae456b50e;
b = 0x3f7061798eb99e238fd6f1bf95b48feeb4854252b;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x2f9f87b7c574d0bdecf8a22e6524775f98cdebdcb, 0x5b935590c155e17ea48eb3ff3718b893df59a05d0];
n = 0x3fffffffffffffffffffe1aee140f110aff961309;
h = 0x2;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 + x y &= x^3 + a x^2 + b \pmod{f(z)} \\
f(z) &= z^{163} + z^{8} + z^{2} + z^{1} + 1 \\
a &= 0x7a526c63d3e25a256a007699f5447e32ae456b50e \\
b &= 0x3f7061798eb99e238fd6f1bf95b48feeb4854252b \\
G &= (0x2f9f87b7c574d0bdecf8a22e6524775f98cdebdcb, 0x5b935590c155e17ea48eb3ff3718b893df59a05d0) \\
n &= 0x3fffffffffffffffffffe1aee140f110aff961309 \\
h &= 0x2
\end{aligned}$
Copy to clipboard