Knowledge Base
Elliptic-Curve Parameter
A

Tom-256

Summary

Name:
Tom-256
Long Name:
Tom (256-bit)
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)
0xffffffff0000000100000000000000017e72b42b30e7317793135661b1c4b117
Copy to clipboard
Coefficient (a)
0x776679e96d94aff61a5fb6d256dece8a9162868d9a3fcbcead27946509c31405
Copy to clipboard
Coefficient (b)
0xc0450ed15e63704c6dfdd9be22fd6bbdfe5f4ccbc43c4d88a2ec905a2af4fef7
Copy to clipboard
Generator (x)
0x2
Copy to clipboard
Generator (y)
0x563b74484ddda63cd63270827428d939b7b7864fcc743d68eb3b1d421f9b3d98
Copy to clipboard
Order (n)
0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff
Copy to clipboard
Cofactor (h)
0x1
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
MIHgAgEBMCwGByqGSM49AQECIQD/////AAAAAQAAAAAAAAABfnK0KzDnMXeTE1Zh
scSxFzBEBCB3ZnnpbZSv9hpfttJW3s6KkWKGjZo/y86tJ5RlCcMUBQQgwEUO0V5j
cExt/dm+Iv1rvf5fTMvEPE2IouyQWir0/vcEQQQAAAAAAAAAAAAAAAAAAAAAAAAA
AAAAAAAAAAAAAAAAAlY7dEhN3aY81jJwgnQo2Tm3t4ZPzHQ9aOs7HUIfmz2YAiEA
/////wAAAAEAAAAAAAAAAAAAAAD///////////////8CAQE=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xffffffff0000000100000000000000017e72b42b30e7317793135661b1c4b117;
a = 0x776679e96d94aff61a5fb6d256dece8a9162868d9a3fcbcead27946509c31405;
b = 0xc0450ed15e63704c6dfdd9be22fd6bbdfe5f4ccbc43c4d88a2ec905a2af4fef7;
E = ellinit([a, b], p);
G = [0x2, 0x563b74484ddda63cd63270827428d939b7b7864fcc743d68eb3b1d421f9b3d98];
n = 0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff;
h = 0x1;
Copy to clipboard

LaTeX

$\begin{aligned}
y^2 &\equiv x^3 + a x + b \pmod{p} \\
p &= 0xffffffff0000000100000000000000017e72b42b30e7317793135661b1c4b117 \\
a &= 0x776679e96d94aff61a5fb6d256dece8a9162868d9a3fcbcead27946509c31405 \\
b &= 0xc0450ed15e63704c6dfdd9be22fd6bbdfe5f4ccbc43c4d88a2ec905a2af4fef7 \\
G &= (0x2, 0x563b74484ddda63cd63270827428d939b7b7864fcc743d68eb3b1d421f9b3d98) \\
n &= 0xffffffff00000001000000000000000000000000ffffffffffffffffffffffff \\
h &= 0x1
\end{aligned}$
Copy to clipboard