Question

Create a textfile called input.txt that contains the string “Hello World!”

a. Using openssl, encrypt the input file using CBC, where the DES algorithm is used. Name the output file output.enc

What is the command you used to perform the task above?

b. Now decrypt the output.enc file and name the file decrypted.txt

What is the command you used to perform this task?

c. Use openssl to generate MD5 message digest of input.txt and decrypted.txt

What is the command you used to perform this task?

d. Use openssl to generate SHA1message digest of input.txt and decrypted.txt

What is the command you used to perform this task?

e. Use openssl to generate a pair of public and private key pair with 2048 bits.

What is the command you used to perform this task?

Answer 1

#include<bits/stdc++.h>
#define MAX 100
using namespace std;

int maze[MAX][MAX];
bool path[MAX][MAX];
vector< pair<int,int> > pathTraverse;
bool findPathUtil(int pos_i,int pos_j,int N,int M)
{
  
   if(pos_i==N-2 && pos_j==M-2)
   {
       cout<<"solution was found at: "<<endl;
       for(int i=0;i<pathTraverse.size();i++)
       {
           cout<<"("<<pathTraverse[i].first<<","<<pathTraverse[i].second<<")";
       }
  
       cout<<endl<<endl;
       return true;
   }
   int next_i,next_j;
   for(int dir=0;dir<4;dir++)
   {
       if(dir==0)       //move farword
       {
           next_i=pos_i;
           next_j=pos_j+1;
           if(next_i>=0 && next_i<N && next_j >=0 && next_j <M)
           {
          
           if(!path[next_i][next_j] && maze[next_i][next_j]==0)
           {
              
               path[next_i][next_j]=true;
               pathTraverse.push_back(make_pair(next_i,next_j));
               findPathUtil(next_i,next_j,N,M);
               path[next_i][next_j]=false;
               pathTraverse.pop_back();
              
           }
           }
       }
       if(dir==1)       //move backword
       {
           next_i=pos_i;
           next_j=pos_j-1;
           if(next_i>=0 && next_i<N && next_j >=0 && next_j <M)
           {
          
           if(!path[next_i][next_j] && maze[next_i][next_j]==0)
           {
                   path[next_i][next_j]=true;
               pathTraverse.push_back(make_pair(next_i,next_j));
               findPathUtil(next_i,next_j,N,M);
               path[next_i][next_j]=false;
               pathTraverse.pop_back();
           }
           }
       }
       if(dir==2)   //move up
       {
           next_i=pos_i-1;
           next_j=pos_j;
           if(next_i>=0 && next_i<N && next_j >=0 && next_j <M)
           {
          
           if(!path[next_i][next_j] && maze[next_i][next_j]==0)
           {
               path[next_i][next_j]=true;
               pathTraverse.push_back(make_pair(next_i,next_j));
               findPathUtil(next_i,next_j,N,M);
               path[next_i][next_j]=false;
               pathTraverse.pop_back();
           }
           }
       }
       if(dir==3)   //move down
       {
           next_i=pos_i+1;
           next_j=pos_j;
           //check if next_i and next_j is within the range
           if(next_i>=0 && next_i<N && next_j >=0 && next_j <M)
           {
          
           if(!path[next_i][next_j] && maze[next_i][next_j]==0)
           {
               path[next_i][next_j]=true;       //make path visited
               pathTraverse.push_back(make_pair(next_i,next_j));
               findPathUtil(next_i,next_j,N,M);
               path[next_i][next_j]=false;       //make path unvisited
               pathTraverse.pop_back();   // remove path
           }
           }
       }
   }
       return true;
}
findAllPath(int N,int M)
{
   for(int i=0;i<N;i++)
   {
       for(int j=0;j<M;j++)
       {
           path[i][j]=false;
       }
   }
   path[1][1]=true;
   pathTraverse.push_back(make_pair(1,1));
   findPathUtil(1,1,N,M);
}
int main()
{
   int N,M;
   fstream f("input.txt");

   f>>N;
   f>>M;
   for(int i=0;i<N;i++)
   {
       for(int j=0;j<M;j++)
       {
           f>>maze[i][j];
       }
   }
   findAllPath(N,M);
  
  
}