作者: Selim G. Akl , Henk Meijer
关键词:
摘要: Pseudo random sequences of integers are most commonly generated by linear congruence methods [5] or shift registers [1]. These can be used in cryptology if they cryptographically secure [9]: A pseudo-random sequence is given any segment the sequence, it computationally infeasible to compute other segments sequence.