Deal of The Day! Hurry Up, Grab the Special Discount - Save 25% - Ends In 00:00:00 Coupon code: SAVE25

- Free Preparation Discussions

Eccouncil 212-81 Exam - Topic 5 Question 32 Discussion

Actual exam question for Eccouncil's 212-81 exam

Question #: 32
Topic #: 5

[All 212-81 Questions]

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

Get Premium 212-81 Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel

Mariann

9 months ago

I think the birthday paradox is less relevant here, though.

upvoted 0 times

...

Pamela

9 months ago

The processing speed will brute force algorithms for sure!

upvoted 0 times

...

Tasia

10 months ago

Wait, can they really solve the discrete logarithm problem? Sounds too good to be true.

upvoted 0 times

...

Alyssa

10 months ago

Totally agree, that's a game changer for RSA!

upvoted 0 times

...

Lelia

10 months ago

Quantum computers can factor large integers in polynomial time, right?

upvoted 0 times

...

Chandra

10 months ago

I definitely recall that quantum computers could brute force algorithms, but I think the real threat is their ability to factor large integers efficiently.

upvoted 0 times

...

Brandon

11 months ago

I feel like the birthday paradox was mentioned in class, but I don’t think it’s the main reason RSA is at risk from quantum computing.

upvoted 0 times

...

Janna

11 months ago

I’m not entirely sure, but I think it has to do with solving the discrete logarithm problem? That sounds familiar from our practice questions.

upvoted 0 times

...

Julieta

11 months ago

I remember something about how quantum computers can factor large integers much faster than classical computers, which is a big deal for RSA.

upvoted 0 times

...

Lynsey

11 months ago

Quantum computers can solve the birthday paradox, but I don't think that's the main reason they threaten RSA. I'm leaning towards option D, as I've heard that they can factor large integers much faster than classical computers.

upvoted 0 times

...

Jesusita

11 months ago

The processing speed of quantum computers could potentially brute force RSA algorithms, but I think the real threat is their ability to solve the discrete logarithm problem, which is the foundation of RSA. Option B seems like the best answer.

upvoted 0 times

...

Alva

11 months ago

Hmm, I'm a bit unsure about this one. I know quantum computing is a threat to RSA, but I'm not sure of the exact reason. I'll have to think this through carefully.

upvoted 0 times

...

Francine

11 months ago

I'm pretty confident that the answer is D. Quantum computers can factor large integers in polynomial time, which would break the RSA encryption algorithm.

upvoted 0 times

...

Carey

11 months ago

This is straightforward. The question is asking about the broader security program, not a specific control. The answer has to be information access management, which covers all those security best practices. B is the right choice.

upvoted 0 times

...

Tammy

11 months ago

This looks like a straightforward question about cloud access control. I'll eliminate the options that don't seem to fit and then select the best answer.

upvoted 0 times

...

Skye

11 months ago

I'm a little confused by this question. Deduplication seems like it might be relevant, but I'm not sure how that would help the admin accomplish the task in the shortest amount of time. I'll have to review the concepts a bit more before answering.

upvoted 0 times

...

Raelene

11 months ago

Hmm, I'm not sure about that. Wouldn't a crash cart be a more reliable way to physically access the server and troubleshoot the issue?

upvoted 0 times

...

Patrick

11 months ago

I'm a little confused by the wording of the options. Do they all describe valid failover behaviors, or is there a clear "best" answer here? I'll need to re-read this carefully to make sure I understand the differences between the choices.

upvoted 0 times

...

Emmanuel

2 years ago

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

upvoted 0 times

...

Paz

2 years ago

B sounded plausible too, but D seems more specific.

upvoted 0 times

...

Francesco

2 years ago

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

upvoted 0 times

...

Emmanuel

2 years ago

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

upvoted 0 times

...

Skye

2 years ago

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

upvoted 0 times

...

Paz

2 years ago

I think the question about quantum computing is tricky.

upvoted 0 times

...