Knowledge Base
Elliptic-Curve Parameter
A

tc26-gost-3410-2012-256-paramSetA

Summary

Name:
tc26-gost-3410-2012-256-paramSetA
Long Name:
tc26-gost-3410-2012-256-paramSetA twisted Edwards curve (256-bit prime field)
Key size:
256 bits
Object identifier:
1.2.643.7.1.2.1.1.1
Publishers:
Aliases:
id-tc26-gost-3410-2012-256-paramSetA

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)
0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffd97
Copy to clipboard
Coefficient (a)
0x1
Copy to clipboard
Generator (x)
0xd
Copy to clipboard
Generator (y)
0x60ca1e32aa475b348488c38fab07649ce7ef8dbe87f22e81f92b2592dba300e7
Copy to clipboard
Order (n)
0x400000000000000000000000000000000fd8cddfc87b6635c115af556c360c67
Copy to clipboard
Cofactor (h)
0x4
Copy to clipboard

Representations

PEM

-----BEGIN EC PARAMETERS-----
BgkqhQMHAQIBAQE=
-----END EC PARAMETERS-----
Download ecparam.pem
Copy to clipboard

PARI/GP

p = 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffd97;
a = 0x1;
d = 0x605f6b7c183fa81578bc39cfad518132b9df62897009af7e522c32d6dc7bffb;
\\ curve: a*x^2 + y^2 = 1 + d*x^2*y^2 over GF(p)
G = [0xd, 0x60ca1e32aa475b348488c38fab07649ce7ef8dbe87f22e81f92b2592dba300e7];
n = 0x400000000000000000000000000000000fd8cddfc87b6635c115af556c360c67;
h = 0x4;
Copy to clipboard

LaTeX

$\begin{aligned}
a x^2 + y^2 &\equiv 1 + d x^2 y^2 \pmod{p} \\
p &= 0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffd97 \\
a &= 0x1 \\
d &= 0x605f6b7c183fa81578bc39cfad518132b9df62897009af7e522c32d6dc7bffb \\
G &= (0xd, 0x60ca1e32aa475b348488c38fab07649ce7ef8dbe87f22e81f92b2592dba300e7) \\
n &= 0x400000000000000000000000000000000fd8cddfc87b6635c115af556c360c67 \\
h &= 0x4
\end{aligned}$
Copy to clipboard