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

- Free Preparation Discussions

EC-Council 212-82 Exam - Topic 20 Question 74 Discussion

Posted by Thurman on Oct 12, 2026 at 12:46 AM

In an advancedcybersecurity research lab. a team Is working on developing a new cryptographicprotocol to secure highly sensitive communication. Their goal is to create aprotocol that is resilient against quantum computing attacks, which couldpotentially break many current encryption methods. During their research, theyfocus on the use of hash functions in their protocol. The team experiments withvarious hash functions to ensure the highest level of security. Considering thethreat of quantum computing, which of the following hash functions would be themost appropriate choice fortheir protocol?

Suggested Answer: D

In the context of developing a cryptographic protocol resilient against quantum computing attacks, SHA-3 is the most appropriate choice. Here's why:

Quantum Computing Threats: Quantum computers can potentially break current cryptographic methods like RSA and ECC due to Shor's algorithm. Traditional hash functions like SHA-256 might not offer sufficient security in a post-quantum world.

SHA-3 Overview: SHA-3, part of the Secure Hash Algorithm family, was designed with quantum resistance in mind. It was selected through an open competition by NIST, ensuring it incorporates advanced cryptographic techniques.

Resilience: SHA-3's design is fundamentally different from SHA-2, providing enhanced security properties, including resistance to various attack vectors that might be feasible with quantum computing advancements.


NIST SHA-3 Standard: NIST FIPS PUB 202

Research on quantum-resistant cryptography: IEEE Xplore

Get Premium 212-82 Questions as Interactive Web-Based Practice Test or PDF Real Exam Format Detailed Explanations Instant Access Get Your Practice Test
0 comments · newest first

Currently there are no comments in this discussion, be the first to comment!

0/2000 characters

Save Cancel