Power of function with very large numbers & HEX array

[altenbach]

---

@Jordan_M wrote:

Here is an example that calculates m^n for large numbers.  It is based on the suggestions posted above.  It only works with bases up to 4*10^9..

---

So, it it supposed to work for the problem in post 1? Seems to give the wrong result.

[altenbach]

Seems my old code from the N'th root challenge seems to work just fine. It uses the exponentiation by squaring method.

 

Looking at it, it could be made much more efficient. 😉

[SuperbrainBug]

Hi everyone,

thank you for answers and help, but it seems that I really have Super Bug in my brain because I still did not manage to get this thing going and I still don't see the way how I can use that big reusult (result is string) to use for further calculation of mod --> (982451653^15) mod 1287821 and I don't know what to do next... 

[jcarmody]

I'm curious about why you're trying to solve this problem.  Is it a school assignment?  Are you working on a real-world application with such large numbers?  That'd be interesting. 😄  What is it?  What is the physical significance of the calculation you're trying to perform?  Inquiring minds want to know!

[jcarmody]

---

@SuperbrainBug wrote:

[...] and I don't know what to do next... 

---

1. Solve the problem by hand on a piece of paper, paying attention to the steps you take.
2. Implement the procedure followed in step 1 with LabVIEW.

I think someone has already said this.

[SuperbrainBug]

It's a school assignment... I need to calculate that for diffie-hellman key exchange

[jcarmody]

Why LabVIEW, then?

[SuperbrainBug]

Because we are communicating over serial port (VISA) with one ticket printer and ticket printer uses diffie-hellman key exchange

[jcarmody · Accepted solution]

LabPython will work.  All you need is the dll and OpenG's free library.

The modulo result I get is 156086.  Is this what you expect?

[jcarmody · Accepted solution]

Average time 30 microseconds?  Did I do this correctly?