Question: Cryptography Do not use #include Use this instead: #include Will like immediately if code runs correctly. Q3 (20 pts). Write a C++ function named permute
Cryptography
Do not use #include
Use this instead:
#include
Will like immediately if code runs correctly.

Q3 (20 pts). Write a C++ function named permute that accepts an unsigned integer (32 bit) as input and returns an unsigned int (32 bit) using the permutation function P given below. Here, you can assume bit 1 as the most significant bit and bit 32 as the least significant bit of the input. Therefore, permute(1) should return 512 , which is equal to (00000000000000000000 001000000000)2 because the 32 th bit of input becomes the 23rd bit of the output
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
