Knowledge Base
Elliptic-Curve Parameter
A

Fp384BN

Summary

Name:
Fp384BN
Long Name:
Fp384BN Barreto-Naehrig curve (384-bit prime field)
Key size:
384 bits

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)
0xfffffffffffffffffff2a96823d5920d2a127e3f6fbca024c8fbe29531892c79534f9d306328261550a7cabd7cccd10b
Copy to clipboard
Coefficient (a)
0x0
Copy to clipboard
Coefficient (b)
0x3
Copy to clipboard
Generator (x)
0x1
Copy to clipboard
Generator (y)
0x2
Copy to clipboard
Order (n)
0xfffffffffffffffffff2a96823d5920d2a127e3f6fbca023c8fbe29531892c795356487d8ac63e4f4db17384341a5775
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIIBQAIBATA8BgcqhkjOPQEBAjEA////////////8qloI9WSDSoSfj9vvKAkyPvi
lTGJLHlTT50wYygmFVCnyr18zNELMGQEMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQwAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADBGEEAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAjEA////////////8qloI9WS
DSoSfj9vvKAjyPvilTGJLHlTVkh9isY+T02xc4Q0Gld1AgEB
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xfffffffffffffffffff2a96823d5920d2a127e3f6fbca024c8fbe29531892c79534f9d306328261550a7cabd7cccd10b;
a = 0x0;
b = 0x3;
E = ellinit([a, b], p);
G = [0x1, 0x2];
n = 0xfffffffffffffffffff2a96823d5920d2a127e3f6fbca023c8fbe29531892c795356487d8ac63e4f4db17384341a5775;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xfffffffffffffffffff2a96823d5920d2a127e3f6fbca024c8fbe29531892c79534f9d306328261550a7cabd7cccd10b \\
a &= 0x0 \\
b &= 0x3 \\
G &= (0x1, 0x2) \\
n &= 0xfffffffffffffffffff2a96823d5920d2a127e3f6fbca023c8fbe29531892c795356487d8ac63e4f4db17384341a5775 \\
h &= 0x1
\end{aligned}$
Copy to clipboard