ECCouncil EC-Council Certified Encryption Specialist (ECES) 212-81 Question # 36 Topic 4 Discussion

ECCouncil EC-Council Certified Encryption Specialist (ECES) 212-81 Question # 36 Topic 4 Discussion

212-81 Exam Topic 4 Question 36 Discussion:
Question #: 36
Topic #: 4

Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 ≤ Xi ≤ m.


A.

Lehmer Random Number Generator


B.

Lagged Fibonacci Generator


C.

Linear Congruential Generator


D.

Blum Blum Shub


Get Premium 212-81 Questions

Contribute your Thoughts:


Chosen Answer:
This is a voting comment (?). It is better to Upvote an existing comment if you don't have anything to add.