New answers tagged

3 votes

Could FIPS 186-5 A.1.6 method generate P and Q with different bit size?

Do my understanding correct? No; when it generates $P$ (in step 5.3) and $Q$ (in step 6.3), it passes the intended key length (nlen) to the algorithm in appendix B.9. That algorithm will find a (...
poncho's user avatar
  • 146k
2 votes

Testing whether the Euler Totient of a number equals to certain value

Yes, though it is not completely straightforward. There is a tighter form of Euler's theorem for composite numbers that says that $a^{\lambda(n)}\equiv 1\pmod n$ for $(a,n)=1$ where $\lambda(n)$ is ...
Daniel S's user avatar
  • 22.8k

Top 50 recent answers are included