I need help with generating RSA encryption code for a C programming $($C$90$ standard$)$ for a voting system. It has to encrypt the Voters personal details in the RSA format. Below is the C code for the main.c file.

#include

#include

#include

#include

#define MAX$\_$NUMBER$\_$SIZE

#define MAX$\_$FNAME$\_$SIZE $20$

#define MAX$\_$LNAME$\_$SIZE $20$

#define MAX$\_$MOBNO$\_$SIZE $10$

#define MAX$\_$ID$\_$SIZE $10$

#define MAX$\_$STNUMBER$\_$SIZE $5$

#define MAX$\_$STNAME$\_$SIZE $15$

#define MAX$\_$SUBURB$\_$SIZE $20$

#define MAX$\_$PCODE$\_$SIZE $4$

#define MAX$\_$VOTERS $100$

int MAX$\_$PEOPLE $=0$;

int numVoters $=0$;

struct dateOfBirth$\{$

unsigned int day;

unsigned int month;

unsigned int year;

$\}$;

typedef struct DateOfBirth DoB$\_$t;

struct address$\{$

char streetNumber$[$MAX$\_$STNUMBER$\_$SIZE$]$;

char streetName$[$MAX$\_$STNAME$\_$SIZE$]$;

char suburb$[$MAX$\_$SUBURB$\_$SIZE$]$;

char postCode$[$MAX$\_$PCODE$\_$SIZE$]$;

$\}$;

typedef struct address addr$\_$t;

struct PersonalDetails$\{$

char firstName$[$MAX$\_$FNAME$\_$SIZE$]$;

char lastName$[$MAX$\_$LNAME$\_$SIZE$]$;

addr$\_$t address;

char mobileNumber$[$MAX$\_$MOBNO$\_$SIZE$]$;

DoB$\_$t dateOfBirth;

char shareholderID$[$MAX$\_$ID$\_$SIZE$]$;

$\}$ voters$[$MAX$\_$VOTERS$]$;

$/*$ COLLECTING VOTES $*/$

void numberOfVoters$()$; $/*$ Liam $*/$

void getPersonalDetails$()$; $/*$ Liam $*/$

void encrypt$()$; $/*$ hansali $*/$

void compress$()$; $/*$marcus $*/$

$/*$ RECEIVING VOTES$*/$

void receiveData$()$; $/*$ Liam $*/$

void decompress$()$; $/*$marcus $*/$

void decrypt$()$; $/*$ hansali$*/$

void printResults$()$;

$/*$ MERGE VOTES$*/$

void mergeVotes$()$;

$/************************************************$

Linked List Implementation

$************************************************/$

typedef struct node$\{$

char firstName$[$MAX$\_$FNAME$\_$SIZE$]$;

char lastName$[$MAX$\_$LNAME$\_$SIZE$]$;

int numVotes;

struct node $*$ next;

$\}$ node$\_$t;

$/*$ Candidate$-$related functions $*/$

node$\_$t$*$ createNode$($char$*$ firstName, char$*$ lastName, int numVotes$)$; $/*$ Harry $*/$

void addCandidate$($node$\_$t$**$ head, char$*$ firstName, char$*$ lastName, int numVotes$)$; $/*$ Harry $*/$

void printCandidates$($node$\_$t$*$ head$)$; $/*$ Harry $*/$

void vote$($node$\_$t$*$ head$)$; $/*$ Harry $*/$

node$\_$t$*$ findCandidate$($node$\_$t$*$ head, char$*$ firstName, char$*$ lastName$)$; $/*$ Harry $*/$

node$\_$t$*$ createNode$($char$*$ firstName, char$*$ lastName, int numVotes$)\{$

node$\_$t$*$ newNode $=($node$\_$t$*)$malloc$($sizeof$($node$\_$t$))$;

if $($newNode $==$ NULL$)\{$

fprintf$($stderr$,$ "Memory allocation failed

$")$;

exit$($EXIT$\_$FAILURE$)$;

$\}$

strcpy$($newNode$->$firstName, firstName$)$;

strcpy$($newNode$->$lastName, lastName$)$;

newNode$->$numVotes $=$ numVotes;

newNode$->$next $=$ NULL;

return newNode;

$\}$

void updateVote$($node$\_$t$*$ head, int index, char firstName, char lastName$)\{$

$/*$ Traverse to find candidate

$*$ If doesn't exist $->$ make new candidate

$*/$

node$\_$t$*$ current $=$ head;

$/*$ if new candidate, index is $-1*/$

if$(!($index $>=0))\{$

addCandidate$($current$,$ firstName, lastName$)$;

printf$("$Added new Candidate!

$")$;

return;

$\}$

$/*$ Iterate current to given index and increase vote$*/$

int counter;

for$($counter $=0$; counter $<=$ index; counter$++)\{$

current $=$ current$->$next;

$\}$

$/*$ found current, increase vote by $1*/$

current$->$numVotes $+=1$;

printf$("$Added vote for $\%$s $\%$s

$",$ current$->$firstName, current$->$lastName$)$;

$\}$

$/*$ Function to add a candidate to the linked list $*/$

void addCandidate$($node$\_$t$**$ head, char$*$ firstName, char$*$ lastName, int numVotes$)\{$

node$\_$t$*$ existingCandidate $=$ findCandidate$(*$head$,$ firstName, lastName$)$;

if $($existingCandidate $!=$ NULL$)\{$

existingCandidate$->$numVotes$++$;

printf$("$Added a vote to existing candidate $\%$s $\%$s

$",$ firstName, lastName$)$;

$\}$ else $\{$

if $(*$head $==$ NULL$)\{$

$*$head $=$ createNode$($firstName$,$ lastName, numVotes$)$;

$\}$ else $\{$

node$\_$t$*$ current $=*$head;

while $($current$->$next $!=$ NULL$)\{$

current $=$ current$->$next;

$\}$

current$->$next $=$ createNode$($firstName$,$ lastName, numVotes$)$;

$\}$

printf$("$Added new candidate $\%$s $\%$s with $1$ vote

$",$ firstName, lastName$)$;

$\}$

$\}$

$/*$ Function to find a candidate in the linked list $*/$

node$\_$t$*$ findCandidate$($node$\_$t$*$ head, char$*$ firstName, char$*$ lastName$)\{$

node$\_$t$*$ current $=$ head;

while $($current $!=$ NULL$)\{$

if $($strcmp$($current$->$firstName, firstName$)==0$ && strcmp$($current$->$lastName, lastName$)==0)\{$

return current; $/*$ Candidate found $*/$

$\}$

current $=$ current$->$next;

$\}$

return NULL; $/*$ Candidate not found $*/$

$\}$

$/*$ Function to vote for a candidate $*/$

void vote$($node$\_$t$*$ head$)\{$

int choice;

printf$("$

Vote for a candidate $($Enter $0$ to add a new candidate$)$: $")$;

scanf$("\%$d$",$ &choice$)$;

if $($choice $==0)\{$

char firstName$[$MAX$\_$NAME$\_$SIZE$]$;

char lastName$[$MAX$\_$NAME$\_$SIZE$]$;

printf$("$Enter the first name of the new candidate: $")$;

scanf$("\%$s$",$ firstName$)$;

printf$("$Enter the last name of the new candidate:

Please write the correct encryption and decryption codes.