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
Mail Us support@pass4success.com
Location US
Mob_nav_barsMENU

Eccouncil Exam 112-51 Topic 1 Question 4 Discussion

Actual exam question for Eccouncil's 112-51 exam
Question #: 4
Topic #: 1
[All 112-51 Questions]

Peter, a security professional, was hired by an organization and was instructed to secure the application and its content from unauthorized access. In this process, Peter implemented a public-key cryptosystem that uses modular arithmetic and elementary number theory for Internet encryption and user authentication.

Which of the following algorithms was employed by Peter in the above scenario?

Show Suggested Answer Hide Answer
Suggested Answer: A

RSA is a public-key cryptosystem that uses modular arithmetic and elementary number theory for Internet encryption and user authentication. RSA stands for Rivest-Shamir-Adleman, the names of the inventors of the algorithm. RSA allows users to generate a pair of keys, one public and one private, that are mathematically related. The public key can be used to encrypt messages or verify digital signatures, while the private key can be used to decrypt messages or create digital signatures. RSA is based on the difficulty of factoring large numbers, which makes it secure and widely used12. Reference: What is Public-Key Cryptosystem in Information Security?, Network Defense Essentials (NDE) | Coursera


by Kristeen at Apr 11, 2024, 12:10 PM

Limited Time Offer

25%

Off

Get Premium 112-51 Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel
Rolande
5 days ago
I'm not so sure. MD6 is a newer hash function, and it could potentially be used in a public-key system. This one's got me stumped.
upvoted 0 times
...
Ashlyn
7 days ago
Ah, this question is a classic! Public-key cryptosystem, modular arithmetic, and number theory? That's gotta be RSA, no doubt about it.
upvoted 0 times
...

Save Cancel