Knowledge Base
Elliptic-Curve Parameter
A

ssc-224

Summary

Name:
ssc-224
Long Name:
MIRACL Standard Secure Curve (224-bit)
Key size:
224 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)
0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbedf
Copy to clipboard
Coefficient (a)
0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbedc
Copy to clipboard
Coefficient (b)
0xadf85458a2bb4a9aafdc5620273d3cf1d8b9c583ce2d3695a9e13a03
Copy to clipboard
Generator (x)
0x0
Copy to clipboard
Generator (y)
0x5b7687e285ec86e26dfd84f0f2e2d409391595f7f9b40cca9d0d20c
Copy to clipboard
Order (n)
0xc90fdaa22168c234c4c6628b80dd2439be5b2b827a9ffbea7240e5cd
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIHIAgEBMCgGByqGSM49AQECHQDJD9qiIWjCNMTGYouA3BzRKQJOCIpnzHQCC77f
MDwEHMkP2qIhaMI0xMZii4DcHNEpAk4IimfMdAILvtwEHK34VFiiu0qar9xWICc9
PPHYucWDzi02lanhOgMEOQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABbdo
fiheyG4m39hPDy4tQJORWV9/m0DMqdDSDAIdAMkP2qIhaMI0xMZii4DdJDm+WyuC
ep/76nJA5c0CAQE=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbedf;
a = 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbedc;
b = 0xadf85458a2bb4a9aafdc5620273d3cf1d8b9c583ce2d3695a9e13a03;
E = ellinit([a, b], p);
G = [0x0, 0x5b7687e285ec86e26dfd84f0f2e2d409391595f7f9b40cca9d0d20c];
n = 0xc90fdaa22168c234c4c6628b80dd2439be5b2b827a9ffbea7240e5cd;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbedf \\
a &= 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbedc \\
b &= 0xadf85458a2bb4a9aafdc5620273d3cf1d8b9c583ce2d3695a9e13a03 \\
G &= (0x0, 0x5b7687e285ec86e26dfd84f0f2e2d409391595f7f9b40cca9d0d20c) \\
n &= 0xc90fdaa22168c234c4c6628b80dd2439be5b2b827a9ffbea7240e5cd \\
h &= 0x1
\end{aligned}$
Copy to clipboard