RSA {3} 给n,e,dp,c 2023-02-14 1 min read # math # crypto dP dP≡d(modp−1)dP \equiv d \pmod{p-1} dP≡d(modp−1) ∵dP×e≡d×e≡1(modp−1)\because dP \times e \equiv d \times e \equiv 1 \pmod {p - 1}∵dP×e≡d×e≡1(modp−1) ∴dP×e−1≡k×(p−1)\therefore dP \times e - 1 \equiv k \times (p - 1)∴dP×e−1≡k×(p−1) ∴(dP×e−1)×d×e≡k′×(p−1),k′≡k×d×e\therefore (dP \times e - 1) \times d \times e \equiv k' \times (p - 1), k' \equiv k \times d \times e∴(dP×e−1)×d×e≡k′×(p−1),k′≡k×d×e ⇔\Leftrightarrow⇔ dP
