Eccouncil Exam 212-81 Topic 5 Question 32 Discussion

Actual exam question for Eccouncil's 212-81 exam

Question #: 32
Topic #: 5

Why is quantum computing a threat to RSA?

AThe processing speed will brute force algorithms

BQuantum computers can solve the discrete logarithm problem

CQuantum computers can solve the birthday paradox

DQuantum computers can factor large integers in polynomial time

Show Suggested Answer

Suggested Answer: D

by Deandrea at May 09, 2024, 05:56 PM

Limited Time Offer

25%

Off

Contribute your Thoughts:

Submit Cancel

5 months ago

Yes, discrete logarithm is different. D is the way to go.

upvoted 0 times

...

5 months ago

B sounded plausible too, but D seems more specific.

upvoted 0 times

...

5 months ago

True, RSA relies on hard factoring. D feels correct.

upvoted 0 times

...

6 months ago

I agree. Quantum computers can factor large integers fast. Makes sense.

upvoted 0 times

...

7 months ago

Yeah, it's hard. But isn't D the right answer?

upvoted 0 times

...

7 months ago

I think the question about quantum computing is tricky.

upvoted 0 times

...