Vote UpVote

Hensel’s lifting

The Programming Works – 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: suppose we know the solution for : then the solution for is either or Example: solve We start with the trivial which can be nothing else but ; next, which can be either or ; checking the first alternative gives , so ; next, ; checking gives , so ; next, ; checking gives , so ; finally, ...
Favorite? Off-Topic? Serg @ 2016-05-02 14:15


Visits: 1021
Votes: 0
Favorites: 0
Off-Topic: 1

Visits by Source

User Actions

Users who voted for this posting

Contact us to advertise on DelphiFeeds.com

Community Links

Torry Firebird News


Please login or register to use this functionality.
(click on this box to dismiss)