Knowledge Base
Elliptic-Curve Parameter
A

mnt5/1

Summary

Name:
mnt5/1
Long Name:
MNT Curve 5 Variant 1
Key size:
240 bits
Publishers:
MNT

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)
0xd2fffffffffffffffffffffffe9058d000000000000000000000a0271007
Copy to clipboard
Coefficient (a)
0xd149265d4687dcab1f2046e0947e51ac5e8e7f25916d35539d4df2e9017a
Copy to clipboard
Coefficient (b)
0x489e7783a1f584712bd4f6d48cf2d1ca2c975678936e639083991c5fc369
Copy to clipboard
Generator (x)
0x0
Copy to clipboard
Generator (y)
0x374afa2d4ebcdf438f0057d15739e54be1e3285cebdad6655564f2d7a207
Copy to clipboard
Order (n)
0xd2fffffffffffffffffffffffe9058d000000000000000000000a0271005
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIHUAgEBMCoGByqGSM49AQECHwDS///////////////+kFjQAAAAAAAAAAAAAKAn
EAcwQAQe0UkmXUaH3KsfIEbglH5RrF6OfyWRbTVTnU3y6QF6BB5InneDofWEcSvU
9tSM8tHKLJdWeJNuY5CDmRxfw2kEPQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAA3SvotTrzfQ48AV9FXOeVL4eMoXOva1mVVZPLXogcCHwDS////////////
///+kFjQAAAAAAAAAAAAAKAnEAUCAQE=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xd2fffffffffffffffffffffffe9058d000000000000000000000a0271007;
a = 0xd149265d4687dcab1f2046e0947e51ac5e8e7f25916d35539d4df2e9017a;
b = 0x489e7783a1f584712bd4f6d48cf2d1ca2c975678936e639083991c5fc369;
E = ellinit([a, b], p);
G = [0x0, 0x374afa2d4ebcdf438f0057d15739e54be1e3285cebdad6655564f2d7a207];
n = 0xd2fffffffffffffffffffffffe9058d000000000000000000000a0271005;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xd2fffffffffffffffffffffffe9058d000000000000000000000a0271007 \\
a &= 0xd149265d4687dcab1f2046e0947e51ac5e8e7f25916d35539d4df2e9017a \\
b &= 0x489e7783a1f584712bd4f6d48cf2d1ca2c975678936e639083991c5fc369 \\
G &= (0x0, 0x374afa2d4ebcdf438f0057d15739e54be1e3285cebdad6655564f2d7a207) \\
n &= 0xd2fffffffffffffffffffffffe9058d000000000000000000000a0271005 \\
h &= 0x1
\end{aligned}$
Copy to clipboard