c++ - 将位分配给动态位集以在 C++ 中运行

标签 c++ boost-dynamic-bitset

此代码使用类,类 rsa 具有一个函数集,该函数集应该采用 3 个整数和 1 个动态位集。然而编译器返回错误,我认为它们都是关于同一件事的:

damage.cc: In function ‘int main()’:
damage.cc:81:27: error: no matching function for call to ‘public_key::set(int, int, int, int)’
 usr1.set (11, 5, 23, 00001);
                           ^
damage.cc:81:27: note: candidate is:
damage.cc:59:6: note: void rsa::set(int, int, int, const boost::dynamic_bitset<>&)
 void rsa::set(int p_, int q_, int d_, const boost::dynamic_bitset <>& m_ )
      ^
damage.cc:59:6: note:   no known conversion for argument 4 from ‘int’ to ‘const boost::dynamic_bitset<>&’
damage.cc:82:27: error: no matching function for call to ‘public_key::set(int, int, int, int)’
 usr2.set (13, 7, 97, 00010);
                           ^
damage.cc:82:27: note: candidate is:
damage.cc:59:6: note: void rsa::set(int, int, int, const boost::dynamic_bitset<>&)
 void rsa::set(int p_, int q_, int d_, const boost::dynamic_bitset <>& m_ )
      ^
damage.cc:59:6: note:   no known conversion for argument 4 from ‘int’ to ‘const boost::dynamic_bitset<>&’
damage.cc:83:29: error: no matching function for call to ‘public_key::set(int, int, int, int)’
 usr3.set (11, 17, 997, 00011);
                             ^
damage.cc:83:29: note: candidate is:
damage.cc:59:6: note: void rsa::set(int, int, int, const boost::dynamic_bitset<>&)
 void rsa::set(int p_, int q_, int d_, const boost::dynamic_bitset <>& m_ )
      ^
damage.cc:59:6: note:   no known conversion for argument 4 from ‘int’ to ‘const boost::dynamic_bitset<>&’
damage.cc:84:28: error: no matching function for call to ‘private_key::set(int, int, int, int)’
 usr1r.set (17, 7, 51, 10011);
                            ^
damage.cc:84:28: note: candidate is:
damage.cc:59:6: note: void rsa::set(int, int, int, const boost::dynamic_bitset<>&)
 void rsa::set(int p_, int q_, int d_, const boost::dynamic_bitset <>& m_ )
      ^
damage.cc:59:6: note:   no known conversion for argument 4 from ‘int’ to ‘const boost::dynamic_bitset<>&’
damage.cc:85:29: error: no matching function for call to ‘private_key::set(int, int, int, int)’
 usr2r.set (11, 17, 51, 10110);
                             ^
damage.cc:85:29: note: candidate is:
damage.cc:59:6: note: void rsa::set(int, int, int, const boost::dynamic_bitset<>&)
 void rsa::set(int p_, int q_, int d_, const boost::dynamic_bitset <>& m_ )
      ^
damage.cc:59:6: note:   no known conversion for argument 4 from ‘int’ to ‘const boost::dynamic_bitset<>&’

代码如下:

#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <boost/dynamic_bitset.hpp>

using namespace std;
class rsa {
 protected:
 int  polyLoc, x, y, p, q, d, m, n, f, e, c, end, k;
 boost::dynamic_bitset<> inpSeq;
 boost::dynamic_bitset<> operSeq;
 boost::dynamic_bitset<> bit;
 vector <int> xorArray;
 vector <int> keyReg;
 public:
 rsa () : polyLoc(3210), inpSeq(5), operSeq(5), bit(5), x(0), y(0), n(0), e(0), c(0), k(0), end(0), f(0) {};
 void set (int , int , int, const boost::dynamic_bitset <>& );
 int key () {
while(polyLoc>0)
 {
  xorArray.push_back(polyLoc%10);
  polyLoc/=10;
 }
 sort(xorArray.rbegin(), xorArray.rend());
 operSeq = inpSeq;
 keyReg.push_back(inpSeq[0]);
  x = xorArray[0];
  do {
  for (unsigned int r = 1; r < xorArray.size(); r++)
  {
  bit[4] = operSeq[x];
  y = xorArray[r];
  bit[4] = bit[4] ^ operSeq[y];
  }
  operSeq >>= 1;
  operSeq[4]  = bit[4];
  keyReg.push_back(operSeq[0]);
 }
 while ((operSeq != inpSeq));
 for ( unsigned int i = 0; i < keyReg.size(); i++)
 {
  if (keyReg[i]==1)
    m = m + int(pow(2,i));
 } 
 n = p*q;
 f = (p-1)*(q-1);
 for (k ; end < 1; k++)
 {
  if ((1+k*f)%d==0) 
   {
    end = 2;
    e = (1+k*f)/d;
   }
 }
 c = int(pow(m,e))%n;
 return c;}
 };
void rsa::set(int p_, int q_, int d_, const boost::dynamic_bitset <>& m_ )
 {
  p = p_;
  q = q_;
  d = d_;
  inpSeq = m_;
 }

class public_key : public rsa {
 public:
 public_key () : rsa () {} ;
};

class private_key : public rsa {
 public:
  private_key () : rsa () {} ;
};

int main()
{
public_key usr1, usr2, usr3;
private_key usr1r, usr2r, usr3r;
usr1.set (11, 5, 23, 00001);
usr2.set (13, 7, 97, 00010);
usr3.set (11, 17, 997, 00011);
usr1r.set (17, 7, 51, 10011);
usr2r.set (11, 17, 51, 10110);
cout << "Public key of user 1: " << usr1.key() << endl;
cout << "Public key of user 2: " << usr2.key() << endl;
cout << "Public key of user 3: " << usr3.key() << endl;
cin.get();
return 0;
}

最佳答案

您必须正确构建 dynamic_bitset .

usr1.set (11, 5, 23, boost::dynamic_bitset<>(std::string("00001")));

对调用 set 的 main() 函数中的每一行执行此操作.

此更改的原因是 dynamic_bitset类有一个采用 std::string 的构造函数。由于它被声明为显式的,因此您必须发送一个 std::string,而不是一个字符串文字或 char 数组。

关于c++ - 将位分配给动态位集以在 C++ 中运行,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/23599878/

相关文章:

c++ - 如何在项目中实现良好的调试/日志记录功能

c++ - 一个尾数下标的明显规范不足:对于原始数组和 std::vector。已经果断解决了吗?

c++ - 如何在结构体中引入dynamic_bitset

c++ - make_unique 不编译

c++ - cpp 中声明的全局变量在 objective c 中使用

C++ 将 dynamic_bitset 存储到文件中

c++ - "No such file"包含 Boost dynamic_bitset 的问题

c++ - 仅 boost dynamic_bitset header

c++ - 在 C++ 中不使用 CLSID 和注册表获取 COM 对象的 DLL 文件