As discussed in Class 05, cryptography is the area of mathematics intended for the study of techniques and principles for transforming information from its original form to another, unintelligible form, so that it can be used only when authorized. According to the definition of encryption, carefully analyze the following situation presented below: For the transmission of encrypted messages between two points A and B, A generates a private key and forwards it to B, A encrypts the message using this same private key and sends this message to B, upon receiving the message, B decrypts the message with the same private key. Regarding the situation presented above, mark the alternative that corresponds to the encryption mode used. A) Cryptographic Abstract; B) Asymmetrical; C) Digital Certification; D) Symmetrical; E) Digital Signature.

As discussed in Class 05, cryptography is the area of mathematics intended for the study of techniques and principles for transforming information from its original form to another, unintelligible form, so that it can be used only when authorized. According to the definition of encryption, carefully analyze the following situation presented below: For the transmission of encrypted messages between two points A and B, A generates a private key and forwards it to B, A encrypts the message using this same private key and sends this message to B, upon receiving the message, B decrypts the message with the same private key. Regarding the situation presented above, mark the alternative that corresponds to the encryption mode used. A) Cryptographic Abstract; B) Asymmetrical; C) Digital Certification; D) Symmetrical; E) Digital Signature.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

RSA is an exponentiation cipher that is used in public key cryptography. Two entities, A and B would wish to exchange data using RSA algorithm and have chosen two prime numbers p and q such that p = 7 and q = 11. Assume a cryptosystem in which each letter of the alphabet is represented by a number between 00 (A) and 25(Z) and a space is represented by 26. A and B have also agreed to generate cryptographic keys such that the private and public key pair for A is d and e respectively while the private and public key pair for B is f and g respectively. Take the key values as follows: d= 53, e = 17, f = 13 and g = 37. A wants to send the message "MY SON " to B in such a way that BOTH the message's confidentiality and authenticity of the sender are preserved. Explain the requirements on both the sender side and the receiver side that will ensure both the message confidentiality and sender authentication for this communication. Clearly show the computations performed by the sender to…
Your task is to design automated solvers for the shift and Vigenere ciphers. You must use C as the under- lying programming language, in order to get prepared for the following labs. Each solver should be completely automated, i.e., upon reading a text ,l.e. containing the target ciphertext (given as command-line argument), it should print the encryption key and the decrypted plaintext without any user interaction. Test your code on the following ciphertexts, and answer these questions: 1. What is the key of the cipher? 2. What is the decrypted plaintext?Shift Cipher - Decrypt the following ciphertext:…
The Lingala Language of Republic of Congo has 35 letters. Consider an Affine cipher, which encrypts each letter according to the rule: C=(p×k1+k2) mod 35. Here C, p, k1, and k2 are each members in the range 0 to 34, where C represents the ciphertext letter, p the plaintext letter, and k1 and k2 are constant keys. How many possible keys does this affine system have? Explain in details.
(do completely) Question 3 One way to solve the key distribution problem is to use a line from a book that both the sender and the receiver possess. Consider the following ciphertext: B G L C J J Y Y N U D N T G T The key used to encrypt the original message is derived from the first letter of the first four words in the first sentence of The Hunt for the Red October, written by Tom Clancy. “Captain First Rank Marko Ramius of the Soviet Navy was dressed for the Arctic conditions normal to the Northen Fleet submarine base at Polyarnyy.” (Hint: The encoder has removed the blanks between the ciphertext. The key used here might not be a meaningful English word. However the plaintext is a meaningful English phrase). (a) Retrieve the key. (b) Retrieve the whole plaintext.
Write a program that performs the brute-force attack to break the password. The following table shows encrypted passwords using the crypt() function. Your mission is to break the password corresponding your CWID in the table. For example, the last digit of your CWID is 1, then you should identify the plaintext password for indBOW06MoVz6. Last digit of CWID Encrypted password 1 indBOW06MoVz6 2 in79RsnfG/VWo 3 inbqJM0dLgWvo 4 incT1ji3YqQ/Y 5 in7haMV00ylgk 6 in1U0tb9WpIcI 7 inPlXS.yNKivQ 8 inqidvfWapJp2 9 injY7hdQJTeu2 0 inQW.HgtuEe. Last digit of CWID Encrypted password 1 indBOW06MoVz6 2 in79RsnfG/VWo 3 inbqJM0dLgWvo 4 incT1ji3YqQ/Y 5 in7haMV00ylgk 6 in1U0tb9WpIcI 7 inPlXS.yNKivQ 8 inqidvfWapJp2 9 injY7hdQJTeu2 0 inQW.HgtuEe. i want answer for 2nd one
A safe is locked by a combination of of four binary digits (that is, 0 or 1), but theowner has forgotten the combination. The safe is designed in such a way that nomatter how many digits have been pressed, if the correct combination of three digitsis pressed at any point, then the safe automatically opens (there is no ”enter” key).Our goal is to find the minimum number of digits that one needs to key in in order toguarantee that the safe opens. In other words, we wish to find the smallest possiblelength of a binary sequence containing every four-digit sequence in it.(a) Create a digraph whose vertex set consists of three-digit binary sequences. Fromeach vertex labelled xyz, there is one outgoing edge (labelled 0) leading to vertexyz0, and another outgoing edge (labelled 1) leading to vertex yz1.(b) Explain why every edge represents a four digit sequence and why an Euleriantour of this graph represents the desired sequence of keystrokes.(c) Find the minimum number of digits that one…
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
You and your friends decided to hold a “Secret Santa” gift exchange, where each person buys a gift for someone else. To see how this whole thing works, let’s consider the following example. Suppose there are 7 people A, B, C, D, E, F, and G. We denote x → y to mean “x gives a gift to y.” If the gift exchange starts with person A, then they give a gift to E. Then E gives a gift to B. And it is entirely possible that B gives a gift to A; in such a case we have completed a “cycle.” In case a cycle occurs, the gift exchange resumes with another person that hasn’t given their gift yet. If the gift exchange resumes with person D, then they give a gift to G. Then G gives a gift to F. Then F gives a gift to C. Then finally C gives a gift to D, which completes another cycle. Since all of the people have given their gifts, the giftexchange is done, otherwise the gift exchange resumes again with another person. All in all, there are two cycles that occurred during the gift exchange: A → E → B → A…
You are a spy, and, conveniently, have a library with an infinite number of books at your disposal. Your operator also has such a library at his disposal. You have agreed to use Lord of the Rings as a one-time pad. Explain how you could use these assets to generate an infinitely long one-time pad.
In C++ Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 383 -5 -1 the output is: x = 3, y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution You can assume the two equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy. #include <iostream>using namespace std; int main() { /* Type your code here. */ return 0;}
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?
a. Develop a Caesar cipher-type encryption algorithm with a little more complexity in it. For example, the algorithm could alternatively shift the cleartext letters positive and negative by the amount of the key value. Variations on this are limitless. b. Select a single-digit key. c. Code a short message using the algorithm and key. d. Give your instructor the algorithm, key, cleartext, and ciphertext. e. Optional: Your instructor will randomly redistribute to the class the ciphertext messages completed in part d above. You are to decode the message you receive as an additional assignment.