Knowledge Base
Elliptic-Curve Parameter
A

sect163k1

Summary

Name:
sect163k1
Long Name:
sect163k1 elliptic curve (binary field GF(2^163))
Key size:
163 bits
Object identifier:
1.3.132.0.1
Aliases:
K-163, ANSIT163K1, WAP-WSG-IDM-ECID-WTLS3, EC2NGF163Koblitz

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)
0x1
Copy to clipboard
Coefficient (b)
0x1
Copy to clipboard
Generator (x)
0x2fe13c0537bbc11acaa07d793de4e6d5e5c94eee8
Copy to clipboard
Generator (y)
0x289070fb05d38ff58321f2e800536d538ccdaa3d9
Copy to clipboard
Order (n)
0x4000000000000000000020108a2e0cc0d99f8a5ef
Copy to clipboard
Cofactor (h)
0x2
Copy to clipboard

Representations

PEM

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

PARI/GP

m = 163;
\\ reduction polynomial: z^163 + z^7 + z^6 + z^3 + 1
a = 0x1;
b = 0x1;
\\ curve: y^2 + x*y = x^3 + a*x^2 + b over GF(2^m)
G = [0x2fe13c0537bbc11acaa07d793de4e6d5e5c94eee8, 0x289070fb05d38ff58321f2e800536d538ccdaa3d9];
n = 0x4000000000000000000020108a2e0cc0d99f8a5ef;
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^{7} + z^{6} + z^{3} + 1 \\
a &= 0x1 \\
b &= 0x1 \\
G &= (0x2fe13c0537bbc11acaa07d793de4e6d5e5c94eee8, 0x289070fb05d38ff58321f2e800536d538ccdaa3d9) \\
n &= 0x4000000000000000000020108a2e0cc0d99f8a5ef \\
h &= 0x2
\end{aligned}$
Copy to clipboard