CTP314 / CTP314.github.io

CTP_314的博客
1 stars 0 forks source link

永远学不会Miller–Rabin和Pollard-Rho算法 | CTime_Pup_314 #4

Open CTP314 opened 5 years ago

CTP314 commented 5 years ago

https://ctp314.github.io/2019/05/07/%E6%B0%B8%E8%BF%9C%E5%AD%A6%E4%B8%8D%E4%BC%9AMiller%E2%80%93Rabin%E5%92%8CPollard-Rho%E7%AE%97%E6%B3%95/

下文未特殊说明则使用 $p$ 代表素数, $n$ 代表自然数 Miller-Rabin素性检验前置知识费马小定理费马小定理的一般表述为 $$\begin{aligned}a^{p-1}\ \equiv\ 1\ (\ mod\ p\ ),\ \forall\ a \in \mathbb{N},\ (a,\ p)\ =\ 1\end{aligned}$$

WA-automaton commented 5 years ago

stO CTP_314