Talk:Modular exponentiation: Difference between revisions
Content added Content deleted
(→Tell algorithm?: sure, make it EC) |
(added a new section, ==task requirements=== -- ~~~~) |
||
| Line 13: | Line 13: | ||
:: I suspect that all practical implementations use the “Right-to-left binary method” (the Tcl version certainly does) as that is clearly much more efficient than the others listed on the WP page for large exponents (which is what you need for the RSA encryption algorithm, by far the most important consumer of this function). Or they use a “left-to-right” method which is actually equivalent but consumes the bits in reverse order. –[[User:Dkf|Donal Fellows]] 20:35, 24 December 2011 (UTC) |
:: I suspect that all practical implementations use the “Right-to-left binary method” (the Tcl version certainly does) as that is clearly much more efficient than the others listed on the WP page for large exponents (which is what you need for the RSA encryption algorithm, by far the most important consumer of this function). Or they use a “left-to-right” method which is actually equivalent but consumes the bits in reverse order. –[[User:Dkf|Donal Fellows]] 20:35, 24 December 2011 (UTC) |
||
I find Kernigh's notes on the OpenJDK algorithm interesting! I'd be in favor of adding an extra credit task to provide a description like this. —[[User:Sonia|Sonia]] 18:40, 25 December 2011 (UTC) |
I find Kernigh's notes on the OpenJDK algorithm interesting! I'd be in favor of adding an extra credit task to provide a description like this. —[[User:Sonia|Sonia]] 18:40, 25 December 2011 (UTC) |
||
==task requirements== |
|||
Did the task's author really mean that the algorithm must work with '''any''' integers <math> a, b, m </math> where <math> b \ge 0 </math> and <math> m > 0 </math> ? |
|||
<br>I re-worked the REXX example to try to accomodate the task's requirements, but nobody else even bothered to address their language's limitation on this issue. -- [[User:Gerard Schildberger|Gerard Schildberger]] 23:55, 14 May 2012 (UTC) |
|||