Knowledge Base
Elliptic-Curve Parameter
A

mnt1

Summary

Name:
mnt1
Long Name:
MNT Curve 1
Key size:
170 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)
0x26dccacc5041939206cf2b7dec50950e3c9fa4827af
Copy to clipboard
Coefficient (a)
0x22ffbb20cc052993fa27dc507800b624c650e4ff3d2
Copy to clipboard
Coefficient (b)
0x1c7be6fa8da953b5624efc72406af7fa77499803d08
Copy to clipboard
Generator (x)
0x106b415d7b4a2d71659ae97440cbb20a6de42d76d69
Copy to clipboard
Generator (y)
0x100580a1c7597ba084b50f3d0a2fc1bf500bc145c2c
Copy to clipboard
Order (n)
0xa60fd646ad409b3312c3b23ba64e082ad7b354d
Copy to clipboard
Cofactor (h)
0x3be9
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIGhAgEBMCEGByqGSM49AQECFgJtzKzFBBk5IGzyt97FCVDjyfpIJ68wMAQWAi/7
sgzAUpk/on3FB4ALYkxlDk/z0gQWAce+b6jalTtWJO/HJAavf6d0mYA9CAQtBAEG
tBXXtKLXFlmul0QMuyCm3kLXbWkBAFgKHHWXughLUPPQovwb9QC8FFwsAhQKYP1k
atQJszEsOyO6ZOCCrXs1TQICO+k=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0x26dccacc5041939206cf2b7dec50950e3c9fa4827af;
a = 0x22ffbb20cc052993fa27dc507800b624c650e4ff3d2;
b = 0x1c7be6fa8da953b5624efc72406af7fa77499803d08;
E = ellinit([a, b], p);
G = [0x106b415d7b4a2d71659ae97440cbb20a6de42d76d69, 0x100580a1c7597ba084b50f3d0a2fc1bf500bc145c2c];
n = 0xa60fd646ad409b3312c3b23ba64e082ad7b354d;
h = 0x3be9;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0x26dccacc5041939206cf2b7dec50950e3c9fa4827af \\
a &= 0x22ffbb20cc052993fa27dc507800b624c650e4ff3d2 \\
b &= 0x1c7be6fa8da953b5624efc72406af7fa77499803d08 \\
G &= (0x106b415d7b4a2d71659ae97440cbb20a6de42d76d69, 0x100580a1c7597ba084b50f3d0a2fc1bf500bc145c2c) \\
n &= 0xa60fd646ad409b3312c3b23ba64e082ad7b354d \\
h &= 0x3be9
\end{aligned}$
Copy to clipboard