Sums of a Random Number of Random Variables and their Approximations with ν- Accompanying Infinitely Divisible Laws

* Research supported by NATO GRANT CRG 900 798 and by Humboldt Award for U.S. Scientists.

Robust Parametric Estimation of Branching Processes with a Random Number of Ancestors

2000 Mathematics Subject Classification: 60J80.

Parametric Estimation in Branching Processes with an Increasing Random Number of Ancestors

2000 Mathematics Subject Classification: 60J80, 62M05

Improved Cryptoanalysis of the Self-shrinking P-adic Cryptographic Generator

The Self-shrinking p-adic cryptographic generator (SSPCG) is a fast software stream cipher. Improved cryptoanalysis of the SSPCG is introduced. This cryptoanalysis makes more precise the length of the period of the generator. The linear complexity and the cryptography resistance against most recently used attacks are invesigated. Then we discuss how such attacks can be avoided. The results show that the sequence generated by a SSPCG has a large period, large linear complexity and is stable against the cryptographic attacks. This gives the reason to consider the SSPSG as suitable for critical cryptographic applications in stream cipher encryption algorithms.

A Limit Theorem for Multi-Type Subcritical Age-Dependent Branching Processes with two Types of Immigration

Марусия Н. Славчова-Божкова - В настоящата работа се обобщава една гранична теорема за докритичен многомерен разклоняващ се процес, зависещ от възрастта на частиците с два типа имиграция. Целта е да се обобщи аналогичен резултат в едномерния случай като се прилагат “coupling” метода, теория на възстановяването и регенериращи процеси.

Offspring Mean Estimators in Branching Processes with Immigration

2000 Mathematics Subject Classification: 60J80.

Functional Transfer Theorems for Maxima of Stationary Processes

2000 Mathematics Subject Classification: 60G70, 60F12, 60G10.

Estimators in Branching Processes with Immigration

2000 Mathematics Subject Classi cation: 60J80.

Probabilistic Models in Cryptography, Coding Theory and Tests for PRNG

2000 Mathematics Subject Classification: 94A29, 94B70

The Number of Parts of Given Multiplicity in a Random Integer Partition

2000 Mathematics Subject Classification: 05A16, 05A17.

Monte Carlo Random Walk Simulations Based on Distributed Order Differential Equations with Applications to Cell Biology

Mathematics Subject Classification: 65C05, 60G50, 39A10, 92C37

Large Distinct Part Sizes in a Random Integer Partition

A partition of a positive integer n is a way of writing it as the sum of positive integers without regard to order; the summands are called parts. The number of partitions of n, usually denoted by p(n), is determined asymptotically by the famous partition formula of Hardy and Ramanujan [5]. We shall introduce the uniform probability measure P on the set of all partitions of n assuming that the probability 1/p(n) is assigned to each n-partition. The symbols E and V ar will be further used to denote the expectation and variance with respect to the measure P . Thus, each conceivable numerical characteristic of the parts in a partition can be regarded as a random variable.