指数求模

最新推荐文章于 2022-11-15 17:31:14 发布

huml126

最新推荐文章于 2022-11-15 17:31:14 发布

阅读量1.8k

点赞数

分类专栏： algorithm 文章标签： modular compute 指数求模

本文链接：https://blog.csdn.net/huml126/article/details/83084406

版权

algorithm 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

指数幂求模

$comupte\ a^{j}\ mod \ p$

Formular

(pq) mod N = ((p mod N)*(q mod N)) mod N

$a^{t}=\left\{ \begin{aligned} a(a^{j/2})^{2}& & j \ is\ odd\ number\\ (a^{j/2})^{2} && j \ is \ even \ number \end{aligned} \right.$

Code Implementation

//
//  main.cpp
//  ModularExponent
//
//  Created by Ronald on 2018/10/16.
//  Copyright © 2018 Ronald. All rights reserved.
//

#include <iostream>
#include <stack>

using namespace std;

//compute a^j%p
int modular_exponent_re(int a,int j, int p){
    if(p<0){
        return -1;
    }
    if(j==0){
        return 1;
    }else{
        int z = modular_exponent_re(a, j/2, p);
        if(j%2==0){
            return ((z%p)*(z%p))%p;
        }else{
            return (a*(z%p)*(z%p))%p;
        }
    }
}

int modular_exponent(int a,int j,int p){
    if(j<0){
        return -1;
    }
    if(j==0){
        return 1;
    }else{
        stack<int> s;
        int result = a;
        while(j){
            s.push(j);
            j=j/2;
        }
        
        while (s.size()>1) {
            int t = s.top();
            s.pop();
            result = ((result%p)*(result%p))%p;
            if (s.empty()) {
                break;
            }
            if (t*2 != s.top()) {
                result = ((a%p)*result)%p;
            }
        }
        return result;
    }
}

int modular_exponent1(int a,int j,int p){
    if(j<0){
        return -1;
    }
    if(j==0){
        return 1;
    }else{
        int result = 1;
        
        while (j>0) {
             if (j%2!=0) {
                result = (a*result)%p;
            }
           // result = ((result%p)*(result%p))%p;
           //a=(a*a)%p
           a = a%p;
           a=(a*a)%p;
           j=j/2;
        }
        return result;
    }
}

s=1
if j is odd s=s*a
$a^{2})^{j/2}$

int modular_exponent_trick(int a,int j,int p){
    int s = 1;
    while(j){
        if (j%2 != 0) {
            s = (s*a)%p;
        }
        a = (a*a)%p;
        j=j/2;
    }
    return s;
}

int main(int argc, const char * argv[]) {
    // insert code here...
    std::cout << "Hello, World!\n";
    std::cout << modular_exponent_re(3, 10, 31)<<endl;
    std::cout << modular_exponent(3, 10, 31)<<endl;
    std::cout << modular_exponent_trick(3, 10, 31)<<endl;
    return 0;
}