Knowledge Base
Elliptic-Curve Parameter
A

JubJub

Summary

Name:
JubJub
Long Name:
JubJub
Key size:
255 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)
0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001
Copy to clipboard
Coefficient (a)
0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000000
Copy to clipboard
Generator (x)
0x5183972af8eff38ca624b4df00384882000c546bf2f39ede7f4ecf1a74f976c4
Copy to clipboard
Generator (y)
0x3b43f8472ca2fc2c9e8fcc5abd9dc308096c8707ffa6833b146bad709349702e
Copy to clipboard
Order (n)
0xe7db4ea6533afa906673b0101343b00a6682093ccc81082d0970e5ed6f72cb7
Copy to clipboard
Cofactor (h)
0x8
Copy to clipboard

Representations

PARI/GP

p = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001;
a = 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000000;
d = 0x2a9318e74bfa2b48f5fd9207e6bd7fd4292d7f6d37579d2601065fd6d6343eb1;
\\ curve: a*x^2 + y^2 = 1 + d*x^2*y^2 over GF(p)
G = [0x5183972af8eff38ca624b4df00384882000c546bf2f39ede7f4ecf1a74f976c4, 0x3b43f8472ca2fc2c9e8fcc5abd9dc308096c8707ffa6833b146bad709349702e];
n = 0xe7db4ea6533afa906673b0101343b00a6682093ccc81082d0970e5ed6f72cb7;
h = 0x8;
Copy to clipboard

LaTeX

$\begin{aligned}
a x^2 + y^2 &\equiv 1 + d x^2 y^2 \pmod{p} \\
p &= 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001 \\
a &= 0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000000 \\
d &= 0x2a9318e74bfa2b48f5fd9207e6bd7fd4292d7f6d37579d2601065fd6d6343eb1 \\
G &= (0x5183972af8eff38ca624b4df00384882000c546bf2f39ede7f4ecf1a74f976c4, 0x3b43f8472ca2fc2c9e8fcc5abd9dc308096c8707ffa6833b146bad709349702e) \\
n &= 0xe7db4ea6533afa906673b0101343b00a6682093ccc81082d0970e5ed6f72cb7 \\
h &= 0x8
\end{aligned}$
Copy to clipboard