2019-09-10, 16:35 | #1 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
2019_{10} Posts |
Power-Modulation Mechanics
Hi all,
I am starting this thread in the hopes of getting some insights in the mechanics of Power-Modulation. I did try to decipher below: https://en.wikipedia.org/wiki/Modular_exponentiation For the sake of argument suppose that there exists a Black-Box that can perform exponentiation instantly but has limited memory and can not perform Modular arithmetic. In other words it can only raise a base to some power as long as it does not run out of memory. By utilizing such a Black-Box how much faster can a regular computer perform PwerMod of 1M-dd exponent? Would that be a significant speed-up? Thanks in advance. |
2019-09-11, 00:32 | #2 |
"Rashid Naimi"
Oct 2015
Remote to Here/There
7E3_{16} Posts |
To clarify, another way of asking the same question is:
* It would probably take a few hours to Fermat-Primality-Test a 1M-dd candidate. * Is bulk of the elapsed time spent raising bases to the necessary intermediate powers or else for modular calculations. I assume the answer is the former. Is that correct? Thanks again in advance. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
More Power!!!! | petrw1 | Teams | 10 | 2019-10-15 17:36 |
Mechanics of DC instead of LL percentage | Fred | PrimeNet | 1 | 2016-02-29 02:19 |
How much power am I really using? | petrw1 | Lounge | 19 | 2013-12-13 13:00 |
Power??? | JohnFullspeed | Programming | 5 | 2011-08-30 16:28 |
IBM Power 6 | Unregistered | Information & Answers | 7 | 2008-08-30 14:36 |