489 views
0 votes
0 votes
Alice wants to communicate with Bob, using public-key cryptography. She establishes
a connection to someone she hopes is Bob. She asks him for his public key and
he sends it to her in plaintext along with an X.509 certificate signed by the root CA.
Alice already has the public key of the root CA. What steps does Alice carry out to
verify that she is talking to Bob? Assume that Bob does not care who he is talking to
(e.g., Bob is some kind of public service).

Please log in or register to answer this question.

Related questions

784
views
1 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
784 views
A math class has 25 students. Assuming that all of the students were born in the firsthalf of the year-between January 1st and June 30th- what is the ... ? Assume that nobody was born on leap day,so there are 181 possible birthdays.
507
views
0 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
507 views
33. Two users can establish a shared secret key using the Diffie-Hellman algorithm, evenif they have never met, share no secrets, and have no certificates(a) ... middle attack.(b) How would this susceptibility change if n or g were secret?
1.8k
views
1 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
1,798 views
The Diffie-Hellman key exchange is being used to establish a secret key betweenAlice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice'ssecret ... 's secret number, y, is 3. Show how Alice and Bobcompute the secret key.
1.2k
views
1 answers
0 votes
ajaysoni1924 asked Mar 19, 2019
1,151 views
Alice and Bob use RSA public key encryption in order to communicate between them.Trudy finds out that Alice and Bob shared one of the primes used to determine thenumber ... pb q. How can Trudy use this information to break Alice's code?