Answer:
No. This is not more secure.
Explanation:
this is not more secure than having all of Carol, bob and Alice having the same key.
alice would be able to know Carol's key for her to be able to verify the answer Carol gave to a challenge by her. she would also have to know bob's key to do the same.
any of these 3 would have to know someone else's secret key to verify answers to any challenge.
the challenge is to know the secret keys if the other two and if done, decryption can easily be done and they can impersonate.
Answer:
The main benefit of the ordered list is that you can apply Binary Search( O( n log n) ) to search the elements. Instead of an unordered list, you need to go through the entire list to do the search( O(n) ).
The main cost of the ordered list is that every time you insert into a sorted list, you need to do comparisons to find where to place the element( O( n log n) ). But, every time you insert into an unsorted, you don't need to find where to place the element in the list ( O(1) ). Another cost for an ordered list is where you need to delete an element, you have an extra cost rearranging the list to maintain the order.
Answer:
yes I agree with you
Explanation:
I have been keyboarding for the past 7 hours.
