Modulus power of big numbers

by

some pseudo code

function powermod(base, exponent, modulus) {
    if (base < 1 || exponent < 0 || modulus < 1)
        return -1

    result = 1;
    while (exponent > 0) {
       if ((exponent % 2) == 1) {
           result = (result * base) % modulus;
       }
       base = (base * base) % modulus;
       exponent = floor(exponent / 2);
    }
    return result;
}

and call

powermod(45, x, 257)

More Related Contents:

  1. Custom Weighted Scale [closed]
  2. Unique (non-repeating) random numbers in O(1)?
  3. What distribution do you get from this broken random shuffle?
  4. Fast way to calculate n! mod m where m is prime?
  5. Need help in mod 1000000007 questions
  6. What is the fastest integer factorization algorithm?
  7. Puzzle: Find largest rectangle (maximal rectangle problem)
  8. Calculate largest inscribed rectangle in a rotated rectangle
  9. The Sieve of Atkin
  10. How do I find a factorial? [closed]
  11. How do I determine whether my calculation of pi is accurate?
  12. “Rounding” colour values to the nearest of a small set of colours
  13. How do I calculate a point on a circle’s circumference?
  14. Is there an O(n) integer sorting algorithm?
  15. Sort points in clockwise order?
  16. How do you calculate the average of a set of circular data? [closed]
  17. Determine font color based on background color
  18. Nearest neighbors in high-dimensional data?
  19. Generate all unique substrings for given string
  20. Algorithm for finding similar images
  21. Why does this simple shuffle algorithm produce biased results?
  22. design a stack such that getMinimum( ) should be O(1)
  23. Floating Point Divider Hardware Implementation Details
  24. How to check if line segment intersects a rectangle?
  25. Two Rectangles intersection
  26. Fastest primality test
  27. How to partition an array of integers in a way that minimizes the maximum of the sum of each partition?
  28. Efficient maths algorithm to calculate intersections
  29. An inverse Fibonacci algorithm?
  30. Optimized low-accuracy approximation to `rootn(x, n)`

Leave a Comment