Related questions
Cryptographic Data Objects
B has just received the following message, which represents a cryptographic data object:
{(
{(KPbB)
KPrS mod KPbS}K1,
{|(NB, NA, {{({K2}KPbB, NS)}(G1)
KPrA mod NA}K1, {|{({G3}(KPbA)
KPrS mod KPbS, G2)}K1|}KPrB)|}KPrA
)}KBS
The following explains various terms in this object and some of the abbreviations used:
• {M}K represents the encryption of some message/data M using the key K
• {|M|}K represents the digital signing of some message/data M using the key K
• NX represents a nonce (i.e. a fresh and possibly random number used once only) generated
by X
• KpbX represents the public part of the key pair presumably owned by X
• KprX represents the private part of the key pair presumably owned by X
• KAB represents a symmetric key shared between A and B
• K (or K1, K2, K3 etc.) represents some arbitrary key with no assumptions about its scope
• M represents some alphanumeric/textual message with no assumptions
• G1, G2, G3 etc. are prime numbers
Which of the following sets of keys, nonces, numbers, and alphanumeric/textual messages “best”
represents B’s knowledge, after B applies any number of possible cryptographic operations to the
object above, and assuming that B already has access to key K1 and the public key of any agent:
a) KBS , G2 , KPrB
b) {(KPbB)
KPrS mod KPbS , G2 , KBS , KPrB , {(KPbB)
KPrS mod KPbS}K1, NA , NB
c) NA , NB
d) NA , NB , KBS , KPrB
e) {(KPbB)
KPrS mod KPbS}K1 , {|(NB, NA, {{({K2}KPbB, NS)}(G1)
KPrA mod NA}K1, {|{({G3}(KPbA)
KPrS mod
KPbS, G2)}K1|}KPrB)|}KPrA , NA , NB , KBS , KPrB , {(KPbB)
KPrS mod KPbS
f) G2 , NA , NB , G1 , KBS , KPrB
g) (KPbB)
KPrS mod KPbS , NA , NB , G2 , KBS , KPrB
h) (KPbB)
KPrS mod KPbS , (G1)
KPrA mod NA , NA, NB , G2 , KBS , KPrB
i) (KPbB)
KPrS mod KPbS , G3 , G2 , KBS , KPrB
j) (KPbB)
KPrS mod KPbS , NA , NB , G2 , KBS , KPrB , G3 , (KPbA)
KPrS mod KPbS
k) NB
Explain your answer below
Trending nowThis is a popular solution!
Step by stepSolved in 3 steps
- In Boosting the misclassification calculation is cumulative in nature O True Falsearrow_forwardCreate an Ordered Doubly Linked List in C++. Remember that an ordered Linked List is one where inserts automatically place a new node so that all the nodes retain a certain order. This list should be templated where items should be in "ascending" order (i.e., if it is a list of numbers, it should be of order of least to greatest).arrow_forwardWrite a C++ program that: (1) defines and implements a hash class that constructs a 15 element array (may be implemented using a vector, a deque, or a list, if you prefer), storing strings, using the following hash function: ((first_letter) + (second_letter) + (last_letter))% 15 (2) the driver program should: a. query the user for ten words and store them using the hash technique described above. b. print out the contents of each position of the array (or vector, deque, or whatever you used), showing vacant as well as filled positions. Remember, only 10 of the 15 positions will be filled. c. repeatedly query the user for a target word, hash the word, check for its inclusion in the list of stored words, and report the result. Continue doing this task until the user signals to stop (establish a sentinel condition).arrow_forward
- Q5 What is the value of the following? { x = {a,b}* | y € {a}* : z € {b}* : (x = yz) ^ (|y| # |z) ^ (x ≤ 4}} O {aaaa, aaab, abbb, bbbb} O {aab, abb, aaab, abbb} {a, b, aa, bb, aaa, aab, abb, bbb, aaaa, aaab, abbb, bbbb} O {A, a, b, aa, ab, bb, aaa, aab, abb, bbb, aaaa, aaab, aabb, abbb, bbbb}arrow_forwardWrite the lines of code to insert the key (book's ISBN) and value ("book") pair into "my_hash_table".arrow_forwardjava question 32. need help thank uarrow_forward
- Code: #!/usr/bin/env python2.7 import sys def verify(submission): processed = [ ] if len(submission) % 2 != 0: return False for i in range(0, len(submission) / 2): processed.append(int(submission[i * 2] + submission[(i * 2) + 1], 16)) ekc = [ 0x53, 75, 0x59, 0x2D, 0110, 0x45, 88, 81, 0x2D, 0x39, 0x35, 0x36, 0x30 ] if len(processed) != len(ekc): return False for i in range(len(processed)): if ekc[i] != processed[i]: return False return True if len(sys.argv) != 1: print "Usage: python bytes.pyc" exit(1) submission = raw_input("What is the password? ") if verify(submission): print "That is correct" exit(0)else: print "That is incorrect" exit(2) Question: What is the password that will successfully pass the verify function?arrow_forwardHey there please help with code.arrow_forwardhelp me in question 2arrow_forward
- Background Often, data are stored in a very compact but not human-friendly way. Think of how dishes in a menu can be stored in a restaurant database somewhere in the cloud. One way a dish object can be stored is this: { "name": "Margherita", "calories": 800, "price": 18.90, "is_vegetarian": "yes", "spicy_level": 2 } Obviously, this format is not user-readable, so the restaurant's frontend team produced many lines of code to render and display this content in a way that's more understandable to us, the restaurant users. We have a mini-version of the same task coming up. Given a list of similar complex objects (represented by Python dictionaries), display them in a user-friendly way that we'll define in these instructions. What is a "dish"? In this project, one dish item is a dictionary object that is guaranteed to have the following keys: "name": a string that stores the dish's name. "calories": an integer representing the calorie intake for one serving of the dish. "price": a float to…arrow_forwardCreate a SuffixArray client that, given a string, determines the smallest lexicographically feasible cyclic rotation in linear time. This issue occurs in databases for circular molecules in chemistry, where each molecule is represented as a circular string and a canonical representation (smallest cyclic rotation) is used to enable searches with any rotation as the key. Create a SuffixArray client that, given a string, determines the smallest lexicographically feasible cyclic rotation in linear time. This issue occurs in databases for circular molecules in chemistry, where each molecule is represented as a circular string and a canonical representation (smallest cyclic rotation) is used to enable searches with any rotation as the key.arrow_forwardDesign a class that acquires the JSON string from question #1 and converts it to a class data member dictionary. Your class produces data sorted by key or value but not both. Provide searching by key capabilities to your class. Provide string functionality to convert the dictionary back into a JSON string. question #1: import requestsfrom bs4 import BeautifulSoupimport json class WebScraping: def __init__(self,url): self.url = url self.response = requests.get(self.url) self.soup = BeautifulSoup(self.response.text, 'html.parser') def extract_data(self): data = [] lines = self.response.text.splitlines()[57:] # Skip the first 57 lines for line in lines: if line.startswith('#'): # Skip comment lines continue values = line.split() row = { 'year': int(values[0]), 'month': int(values[1]), 'decimal_date': float(values[2]),…arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSON
Computer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier Science
Network+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning 
Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage Learning
Prelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson Education
Sc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY