解二元一次方程组含MOD26

最新推荐文章于 2022-12-02 11:35:52 发布

机器术士

最新推荐文章于 2022-12-02 11:35:52 发布

阅读量2.3k

点赞数 3

分类专栏：密码学文章标签： c++

本文链接：https://blog.csdn.net/weixin_45758918/article/details/110958410

版权

密码学专栏收录该内容

1 篇文章

订阅专栏

解二元一次方程组含MOD26计算
仿射密码的解密，频率法
C→E，K→T
解方程组
4a+b=2
19a+b=10

代码有参考

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <cstdio>
#include <cstdlib>      
#include <vector>       
#include <algorithm> 

using namespace std;

int main() {
			int a, b, c, d, e, f;
			a = 4;
			b = 1;
			c = 2;		
			d = 19;
			e = 1;
			f = 10;
			cout << a << " |  " << b << " |  " << c << " |  " << d << " |  " << e << " |  " << f << endl;
				int x, y;
				//y = (c * d - f * a) / (b * d - e * a);
				//x = (c - b * y) / a;
				int p = 1;
				do {
					x = (f - c + 26 * p) ;
					//cout << " p= " << p <<  endl;
					p++;

				} while (x%(d - a) != 0);
				x = x / (d - a);

				p = 0;
				do {
					y = c - a * x+ 26 * p;
					p++;
					//cout << " p= " << p <<  endl;
				} while (y <1);				
				//输出方程的解
				cout << " x=" << x  << endl;
				cout << " y=" << y << endl;

	system("pause");
	return 0;

}