Knowledge Base
Elliptic-Curve Parameter
A

ed-256-mont

Summary

Name:
ed-256-mont
Long Name:
Ed-256 Montgomery
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)
0xffa7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff
Copy to clipboard
Coefficient (a)
0xffa7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe
Copy to clipboard
Generator (x)
0x2162e165186fb36258cb6f881bc0fd1e28159b6aa8df44a0e1996bd5a22518ea
Copy to clipboard
Generator (y)
0xe625421cdfbdca90f36d3e16836d338842299e19e545b9fd3f453de277418ed5
Copy to clipboard
Order (n)
0x3fe9ffffffffffffffffffffffffffffb154bbafb86733c966d92eded8ec7bab
Copy to clipboard
Cofactor (h)
0x4
Copy to clipboard

Representations

PARI/GP

p = 0xffa7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff;
a = 0xffa7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe;
d = 0x350a;
\\ curve: a*x^2 + y^2 = 1 + d*x^2*y^2 over GF(p)
G = [0x2162e165186fb36258cb6f881bc0fd1e28159b6aa8df44a0e1996bd5a22518ea, 0xe625421cdfbdca90f36d3e16836d338842299e19e545b9fd3f453de277418ed5];
n = 0x3fe9ffffffffffffffffffffffffffffb154bbafb86733c966d92eded8ec7bab;
h = 0x4;
Copy to clipboard

LaTeX

$\begin{aligned}
a x^2 + y^2 &\equiv 1 + d x^2 y^2 \pmod{p} \\
p &= 0xffa7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff \\
a &= 0xffa7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe \\
d &= 0x350a \\
G &= (0x2162e165186fb36258cb6f881bc0fd1e28159b6aa8df44a0e1996bd5a22518ea, 0xe625421cdfbdca90f36d3e16836d338842299e19e545b9fd3f453de277418ed5) \\
n &= 0x3fe9ffffffffffffffffffffffffffffb154bbafb86733c966d92eded8ec7bab \\
h &= 0x4
\end{aligned}$
Copy to clipboard