- -
Hensel’s lifting
(
https://www.delphipraxis.net/189086-hensel%92s-lifting.html)
| DP News-Robot |
2. Mai 2016 15:10 |
Hensel’s lifting
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: ... http://feeds.feedburner.com/~r/delph...~4/F44dOAm702c
 More... |
| Alle Zeitangaben in WEZ +1. Es ist jetzt 11:05 Uhr. |
|
Powered by vBulletin® Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
LinkBacks Enabled by vBSEO © 2011, Crawlability, Inc.
Delphi-PRAXiS (c) 2002 - 2023 by Daniel R. Wolf, 2024 by Thomas Breitkreuz
