Number theory is full of gems that turn into effective algorithms demanded in cryptography. Consider the congruence where N is odd, and R > N is a power of 2. Probably the most effective algorithm to solve it is based on the Hensel’s lemma; the corollary that applies for our congruence is: ...
More...