C++ Nothing too advanced please. Learning the basics Then swap the first half of each block with the second half. For example:7840 becomes 4078, 3013 becomes 1330, 6558 becomes 5865, and 9971 becomes 7199As a final result, the encrypted integer becomes 4078133058657199.Only if k and block size aknown, it can be decrypted.Apply the same steps for the encrypt.cpp and decrypt.cpp files. This time ask the user to enternumber, a k value and a block size value.Sample output for encrypt.cppEnter a 16-digit integer to encrypt: 2395856810034426Enter a block size (passible values: 2, 4, 8, 16): 4 In this exercise, you will apply a much more complex cypher. Ask the user to enter a long valueof 16 digits. You will use block cypher technique with the addition of Caesar cypher. The blocksize will be entered by the user and valid values could be 2, 4, 8, or 16. Ask the user to enter kvalue as well. Here is how the algorithm will work:Example:Block size: 4k value: 5The 16-digit number will be corsidered in n blocks each of which will consist of 4 digits. In thiscase, we can have 4 blocks of 4-digit values. If the number is 2395856810034426, then theblocks are:2395856810034426For each block apply the Caesar cypher with the given k value 5:2395 -> 78408568 -> 30131003 -> 65584426 -> 9971

#include<iostream>using namespace std; int main(){long long val;cout<<"Enter a 16-digit…

Then swap the first half of each block with the second half. For example: 7840 becomes 4078, 3013 becomes 1330, 6558 becomes 5865, and 9971 becomes 719 As a final result, the encrypted integer becomes 4078133058657199.Only if k and block known, it can be decrypted. Apply the same steps for the encrypt.cpp and decrypt.cpp files. This time ask the user to number, a k value and a block size value.

Then swap the first half of each block with the second half. For example: 7840 becomes 4078, 3013 becomes 1330, 6558 becomes 5865, and 9971 becomes 719 As a final result, the encrypted integer becomes 4078133058657199.Only if k and block known, it can be decrypted. Apply the same steps for the encrypt.cpp and decrypt.cpp files. This time ask the user to number, a k value and a block size value.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

(a) Write a complete PHP code that would produce the output below: 1 12 123 1234 12345 123456 1234567 12345678 123456789 (b) Differentiate between "sha1" and "md5" encryption function of MySQL clearly giving examples of each. (c) Give the major difference between the POST and the GET method.
In a special case of a permutation cipher, we take a message, M, and write its letters in an s× t table, in a row-major fashion, and then let the ciphertext be a column-major listing of the entries in the table. For example, to encrypt the message ATTACKATDAWN, using a 3 × 4 table, we would write the message as ATTA CKAT DAWN and then write down the ciphertext as ACDTKATAWATN. The secret key in this cryptosystem is the pair (s, t). How is decryption done in this cryptosystem? Also, how hard would it be to attack this cryptosystem using a ciphertext-only attack?
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
kindly do it ASAP Write a code to implement the combination of RSA and AES algorithms. In your implementation, first the RSA will be used to encrypt the secret key for sending from Alice to Bob. On the other hand, the AES will be used for encryption and decryption of long messages between the Alice and Bob. Remember in such type of combination, first the Bob will generate its public and private keys and share its public key with the Alice. The Alice encrypt the short message (secret key for communicating the long messages) using RSA and send it to the Bob. Then Bob decrypts the short message (secret key for communicating the long messages) using its private key and found the short message (secret key for communicating long messages). After that both Alice and Bob use this same secret key for the encryption and decryption of long messages.
Using C programming language: A Transposition Cipher A very simple transposition cipher encrypt(S, N) can be described by the following rules: If the length of S is 1 or 2, then encrypt(S, N) is S. If S is a string of N characters s1 s2 s3... sN and k = N/2, then encrypt(S)= encrypt(sk sk−1... s2 s1 ,K)+ encrypt(sN sN−1... sk+1 ,N - K) where + indicates string concatenation. For example, encrypt("Ok", 2) = "Ok" and encrypt("12345678", 8) = "34127856". Write a program to implement this cipher. The input is a file that is guaranteed to have less then 2048 characters. Code structure might look like this: #define MAX_SIZE 2048char text_buffer[MAX_SIZE];int main(){ // read file into text_buffer encrypt(text_buffer, n); // print out text_buffer return 0;}
Which of the following statements about hash pointers in Blockchain is CORRECT? A. A hash pointer is only used to retrieve the information. B. A hash pointer is only used to verify that the information in the previous block hasn't been changed. C. In the blockchain, the head of the list is a regular hash‐pointer that points to the first data block created in the network. D. In the blockchain, if an attacker tampers a block without modifying other blocks, then we cannot detect the change.
For the following question, use the mapping given in the table. A B C D E F G H I J S Z D U F R B K L M K L M N O P Q R S T J V G N A Q O Y W I U V W Z Y Z E C T H P X Encrypt the following: Pure calculation is, in its way, the poetry of logical way of thinking. Decrypt the message with shift of 3. Open WindowDecrypt the message with shift of 25. Open
Substitution Cipher is an old technique that substitutes one thing for another. For example, alphabet messages can be ciphered by applying the following substitution. plaintext: abcdefghijklmnopqrstuvwxyz | | V Vciphertext: mnbvcxzasdfghjklpoiuytrewq However, this type of ciphering produces patterns since the same plaintext strings produce the same cipher text. Polyalphabetic Cipher, on the other hand mitigates this problem as plaintext characters are not always replaced with the same cipher text character. The replacement of each character dependson a key as well as on the position of the character in the text; for example, by using a formula such as: for (int i=0; i < length of P; i++) C[i] = P[i] + K + (i mod 3) In essence, if the key, K, is choses as K=10, then 10 is added to characters in position 0, 3, 6, …; and 11 is added for those in…
PLEASE PLEASE SHOW CALCULATIONS Using the Vigenere cipher given in class: ADQYS MIUSB OXKKT MIBHK IZOOO EQOOG IFBAG KAUMFVVTAA CIDTW MOCIO EQOOG BMBFV ZGGWP CIEKQ HSNEWVECNE DLAAV RWKXS VNSVP HCEUT QOIOF MEGJS WTPCHAJMOC HIUIX Determine the Keys that would be needed to decipher the given cipher given the following deductions made in class Key of length 6; alphabet 1: AIKHOIATTOBGEEERNEOSAI alphabet 2: DUKKEFUAWEMGKWDWSUFWJU alphabet 3: QSTIQBMAMQBWQVLKVTMTMI alphabet 4: YBMZOAFCOOFPHEAXPQEPOX alphabet 5: SOIOOGVICOVCSVASHOGCC alphabet 6: MXBOGKVDIGZINNVVCIJHH
Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Assume we wish to resize an existing hash table because the current hash table is becoming too small for the application. Without writing code briefly describe the process of resizing a hash table by "copying" the old data to the new hash table. What is the expected complexity of your process using Big-O notation. Justify your complexity measure. An example of a hash table before resizing is given.
I need help with this question, please. Parts A and B A.) Add the following numbers to an 11-entry hash table using linear probing to resolve collisions. Stop before adding an item that would result in α > 0.75. This means you might not use all the numbers. (Spoiler alert: you won't use them all.) 39 68 60 71 83 52 99 55 49 77 58 26 76 66 37 28 For the hash function, simply take the number mod the table size. In 11 blanks, write the number that would end up at that entry in the table. If there is no number at that location, write empty. B.) Add the following numbers to a 23-entry hash table using linear probing to resolve collisions. Stop before adding an item that would result in α > 0.75. This means you may not use all the numbers. 39 68 60 71 83 52 99 55 49 77 58 26 76 66 37 28 For the hash function, simply take the number mod the table size. In 23 blanks, write the number that would end up at that entry in the table. If there is no number at that location, write…