RSA 암호화 한 공개키를 클라이언트에게 보내고싶습니다.

#include "pch.h"
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include "encryption.h"
 
 
Encryption::Encryption() {};
Encryption::~Encryption() {};
 
// p, q
void Encryption::Selectpq() 
{
    int random;
    int i, j;
    srand((unsigned)time(NULL));
    random = (rand() % 1000); 
    int ck, ck2 = 0;
    for (i = random; 1; i++)
    {
        for (j = 2; j < i / 2 + 1; j++)
        {
            if (i%j == 0)
            {
                ck = 1;
                break;
            }
            ck = 0;
        }
        if (ck == 0 && ck2 == 1)
        {
            second = i;
            break;
        }
        if (ck == 0 && ck2 == 0)
        {
            first = i;
            ck2 = 1;
        }
 
    }
}
//pi e (1 < e < pi)
void Encryption::SelectEulerETC()
{
    int i, j, tmp = 1;
    pub_Key_First = first * second;
    eulerPi = (first - 1) * (second - 1);
    for (i = 2; i < eulerPi; i++)
    {
        for (j = 1; j <= i; j++)
        {
            if (i%j == 0 && eulerPi%j == 0)
                tmp = j;
        }
        if (tmp == 1)
        {
            pub_Key_Second = i;
            break;
        }
        tmp = 1;
    }
}
//d
void Encryption::SelectPriKey()
{
    int i;
    for (i = 2; i < eulerPi; i++)
    {
        if ((pub_Key_Second * i) % eulerPi == 1)
            pri_Key = i;
    }
}
 
c = m^e mod n
void Encryption::Enc(char buffer[], int bufsize)
{
    for (int k = 0; k == bufsize; k++)
    {
        encrypt[k] = buffer[k];
    }
    for (int i = 0; i < bufsize; i++)
    {
        for (int j = 0; j < pub_Key_Second; j++) // c = m^e mod n
        {
            sum *= (int)encrypt[i]; 
            sum %= pub_Key_First;
            encryptDone[j] = sum;
        }
 
    }
}
// m = c^d mod n
void Encryption::Decryption(char buffer[], int bufsize)
{
    while (decrypt != bufsize)
    {
        for (int j = 0; j < pri_Key; j++)
        {
            word = buffer[j];
            sum *= word; // m = c^d mod n
            sum %= pub_Key_First;
            decryptDone[j] = sum;
        }
 
    }
}

//accept 
        CString str;
        CString ConnectInfo_str;
        CString ConnectInfo_str2;
 
        while (1)
        {
            //ACCEPT 
            enc.Selectpq();
            enc.SelectEulerETC();
            enc.SelectPriKey();
 
            tcpserver.ClntAccept();
            if (clnt_sock == SOCKET_ERROR)
            {
                break;
            }

    CServerDlg *dlg = (CServerDlg *)AfxGetApp()->m_pMainWnd;
    SOCKET socket = (SOCKET)p;
 
    char encPubKey_First[BUFSIZE];
    char encPubKey_Second[BUFSIZE];
    sprintf(encPubKey_First, "%u", enc.pub_Key_First);
    sprintf(encPubKey_Second, "%u", enc.pub_Key_Second);
    send(socket, encPubKey_First, sizeof(encPubKey_First), 0);
    while (1)
    {
        //recv
 
        tcpserver.ServRecv(socket); 
        if (tcpserver.recvsize <= 0) {
            break;
        }

#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>
#include "ServerClass.h"
class Encryption
{
public:
    Encryption();
    ~Encryption();
    int sum = 1;
    int first;
    int second;
    int pub_Key_First; //n 공개기 및 개인키
    int eulerPi;
    int pub_Key_Second; //e 공개키
    int pri_Key; //d 개인키
 
    int decrypt;
    int word;
 
    char encrypt[BUFSIZE]; //BUFSIZE
    char encryptDone[BUFSIZE];
    char decryptDone[BUFSIZE];
 
    void Selectpq();
    void SelectEulerETC();
    void Enc(char buffer[], int bufsize);
    void Decryption(char buffer[], int bufsize);
    void SelectPriKey();
};