## 25 May Practice Test Question-Cryptographic Algorithms

Preparing for your next security certification exam? After trying your hand at this practice test question, join the FREE CertMike Study Group for the CISSP, Security+, CySA+, PenTest+, CISM+ or SSCP certification to receive new questions each week. You’ll also receive free access to my customized study strategies.

#### Which one of the following cryptographic algorithms does not depend upon the prime factorization problem?

A. RSA

B. GPG

C. ECC

D. PGP

Correct Answer: C

The prime factorization problem forms the basis for most public key cryptographic algorithms, including RSA, PGP, and GPG. So, that eliminates all three of those – RSA, PGP, and GPG – as the answer. The elliptic curve cryptosystem (ECC) does not depend upon the prime factorization problem. The security of ECC depends upon the difficulty of finding the discrete logarithm of a random elliptic curve element with respect to a publicly known base point. That makes it our correct answer!

## No Comments