On the Generation of Cryptographically Strong Pseudo-Random Sequences

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-10843-2_43
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On Parallel Pseudo-Random Number Generation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Efficient Parallel Pseudo-Random Number Generation

English

On the Strong Law of Large Numbers for Generalized Pairwise NQD Random Sequences

Pure Mathematics
2012English

Pseudo Random Number Generation Using Eye Brightness Response

ICTACT Journal on Communication Technology
2018English

On Pseudo-Random Oracles

Tatra Mountains Mathematical Publications
Mathematics
2012English

Remarks on "Random Sequences"

The Australasian Journal of Logic
2015English

Pseudo Leja Sequences

Annali di Matematica Pura ed Applicata
Applied Mathematics
2010English

Note on Strong Pseudo-Valuation Domains

Bulletin of the Faculty of Science, Ibaraki University. Series A, Mathematics
1989English

On Random Sequences of Integers

Bulletin of the American Mathematical Society
1970English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy