Arithmetic facts about p = 2^255 - 19 #
The non-squareness of d is Euler's criterion evaluated by decide +kernel, with fuelled
square-and-multiply so the exponent never unfolds in unary.
@[reducible, inline]
Instances For
Square-and-multiply modulo m, structural on fuel so the kernel can evaluate it.
Equations
- One or more equations did not get rendered due to their size.
- Cryptlib.Primitives.Sign.Ed25519Facts.powModAux m 0 x✝² x✝¹ x✝ = x✝
Instances For
The small integer -121665 * 121666 mod p; d = -121665/121666 is this over 121666^2.
Equations
- Cryptlib.Primitives.Sign.Ed25519Facts.n0 = 57896044618658097711785492504343953926634992332820282019728792003941762326059
Instances For
theorem
Cryptlib.Primitives.Sign.Ed25519Facts.natCast_ne_zero
{n : ℕ}
(h0 : n ≠ 0)
(hlt : n < NIKE.X25519Common.p)
:
Edwards d for Ed25519.
Equations
- Cryptlib.Primitives.Sign.Ed25519Facts.d = -121665 / 121666
Instances For
√-1 in F.
Equations
- Cryptlib.Primitives.Sign.Ed25519Facts.i = ↑19681161376707505956807079304988542015446066515923890162744021073123829784752
Instances For
c = √-486664, the constant of the birational map.
Equations
- Cryptlib.Primitives.Sign.Ed25519Facts.c = ↑6853475219497561581579357271197624642482790079785650197046958215289687604742
Instances For
No point of Curve25519 has u = -1: that would need 486660 to be a square.