Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...
In this paper we discuss PRNGs: the mechanisms used by real-world secure systems to generate cryptographic keys, initialization vectors, "random" nonces, and other values...
John Kelsey, Bruce Schneier, David Wagner, Chris H...
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...