Knowledge Base
Elliptic-Curve Parameter
A

ssc-192

Summary

Name:
ssc-192
Long Name:
MIRACL Standard Secure Curve (192-bit)
Key size:
192 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)
0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cd13
Copy to clipboard
Coefficient (a)
0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cd10
Copy to clipboard
Coefficient (b)
0xadf85458a2bb4a9aafdc5620273d3cf1d8b9c583ce2d36a6
Copy to clipboard
Generator (x)
0x0
Copy to clipboard
Generator (y)
0x44ea83c359a0936597c81d378cd6a39c835b09a53baa5fe1
Copy to clipboard
Order (n)
0xc90fdaa22168c234c4c6628c5dca19490dd3e6fd7979a7a3
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIGwAgEBMCQGByqGSM49AQECGQDJD9qiIWjCNMTGYouA3BzRKQJOCIpnzRMwNAQY
yQ/aoiFowjTExmKLgNwc0SkCTgiKZ80QBBit+FRYortKmq/cViAnPTzx2LnFg84t
NqYEMQQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABE6oPDWaCTZZfIHTeM1qOcg1sJ
pTuqX+ECGQDJD9qiIWjCNMTGYoxdyhlJDdPm/Xl5p6MCAQE=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cd13;
a = 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cd10;
b = 0xadf85458a2bb4a9aafdc5620273d3cf1d8b9c583ce2d36a6;
E = ellinit([a, b], p);
G = [0x0, 0x44ea83c359a0936597c81d378cd6a39c835b09a53baa5fe1];
n = 0xc90fdaa22168c234c4c6628c5dca19490dd3e6fd7979a7a3;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cd13 \\
a &= 0xc90fdaa22168c234c4c6628b80dc1cd129024e088a67cd10 \\
b &= 0xadf85458a2bb4a9aafdc5620273d3cf1d8b9c583ce2d36a6 \\
G &= (0x0, 0x44ea83c359a0936597c81d378cd6a39c835b09a53baa5fe1) \\
n &= 0xc90fdaa22168c234c4c6628c5dca19490dd3e6fd7979a7a3 \\
h &= 0x1
\end{aligned}$
Copy to clipboard