Knowledge Base
Elliptic-Curve Parameter
A

Anomalous

Summary

Name:
Anomalous
Long Name:
Anomalous
Key size:
204 bits
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

Prime (p)
0xb0000000000000000000000953000000000000000000001f9d7
Copy to clipboard
Coefficient (a)
0x98d0fac687d6343eb1a1f595283eb1a1f58d0fac687d635f5e4
Copy to clipboard
Coefficient (b)
0x4a1f58d0fac687d6343eb1a5e2d6343eb1a1f58d0fac688ab3f
Copy to clipboard
Generator (x)
0x101efb35fd1963c4871a2d17edaafa7e249807f58f8705126c6
Copy to clipboard
Generator (y)
0x22389a3954375834304ba1d509a97de6c07148ea7f5951b20e7
Copy to clipboard
Order (n)
0xb0000000000000000000000953000000000000000000001f9d7
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIG6AgEBMCUGByqGSM49AQECGgsAAAAAAAAAAAAAAJUwAAAAAAAAAAAAAfnXMDgE
GgmND6xofWND6xofWVKD6xofWND6xofWNfXkBBoEofWND6xofWND6xpeLWND6xof
WND6xoirPwQ1BAEB77Nf0ZY8SHGi0X7ar6fiSYB/WPhwUSbGAiOJo5VDdYNDBLod
UJqX3mwHFI6n9ZUbIOcCGgsAAAAAAAAAAAAAAJUwAAAAAAAAAAAAAfnXAgEB
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xb0000000000000000000000953000000000000000000001f9d7;
a = 0x98d0fac687d6343eb1a1f595283eb1a1f58d0fac687d635f5e4;
b = 0x4a1f58d0fac687d6343eb1a5e2d6343eb1a1f58d0fac688ab3f;
E = ellinit([a, b], p);
G = [0x101efb35fd1963c4871a2d17edaafa7e249807f58f8705126c6, 0x22389a3954375834304ba1d509a97de6c07148ea7f5951b20e7];
n = 0xb0000000000000000000000953000000000000000000001f9d7;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xb0000000000000000000000953000000000000000000001f9d7 \\
a &= 0x98d0fac687d6343eb1a1f595283eb1a1f58d0fac687d635f5e4 \\
b &= 0x4a1f58d0fac687d6343eb1a5e2d6343eb1a1f58d0fac688ab3f \\
G &= (0x101efb35fd1963c4871a2d17edaafa7e249807f58f8705126c6, 0x22389a3954375834304ba1d509a97de6c07148ea7f5951b20e7) \\
n &= 0xb0000000000000000000000953000000000000000000001f9d7 \\
h &= 0x1
\end{aligned}$
Copy to clipboard