Knowledge Base
Elliptic-Curve Parameter
A

BADA55-VR-256

Summary

Name:
BADA55-VR-256
Long Name:
BADA55-VR-256
Key size:
256 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)
0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff
Copy to clipboard
Coefficient (a)
0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc
Copy to clipboard
Coefficient (b)
0xbada55ecd8bbead3add6c534f92197deb47fceb9be7e0e702a8d1dd56b5d0b0c
Copy to clipboard
Generator (x)
0x0
Copy to clipboard
Generator (y)
0x5310d24619c2e5b721e14dcedc3332d0be3ce9347161ebbc14a43fc7fad546d2
Copy to clipboard
Order (n)
0xffffffff00000000fffffffffffffffebedc2797003336661a49d76a903bdb91
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIHgAgEBMCwGByqGSM49AQECIQD/////AAAAAQAAAAAAAAAAAAAAAP//////////
/////zBEBCD/////AAAAAQAAAAAAAAAAAAAAAP///////////////AQgutpV7Ni7
6tOt1sU0+SGX3rR/zrm+fg5wKo0d1WtdCwwEQQQAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAFMQ0kYZwuW3IeFNztwzMtC+POk0cWHrvBSkP8f61UbSAiEA
/////wAAAAD//////////r7cJ5cAMzZmGknXapA725ECAQE=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff;
a = 0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc;
b = 0xbada55ecd8bbead3add6c534f92197deb47fceb9be7e0e702a8d1dd56b5d0b0c;
E = ellinit([a, b], p);
G = [0x0, 0x5310d24619c2e5b721e14dcedc3332d0be3ce9347161ebbc14a43fc7fad546d2];
n = 0xffffffff00000000fffffffffffffffebedc2797003336661a49d76a903bdb91;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff \\
a &= 0xffffffff00000001000000000000000000000000fffffffffffffffffffffffc \\
b &= 0xbada55ecd8bbead3add6c534f92197deb47fceb9be7e0e702a8d1dd56b5d0b0c \\
G &= (0x0, 0x5310d24619c2e5b721e14dcedc3332d0be3ce9347161ebbc14a43fc7fad546d2) \\
n &= 0xffffffff00000000fffffffffffffffebedc2797003336661a49d76a903bdb91 \\
h &= 0x1
\end{aligned}$
Copy to clipboard