background: a boron neutron capture therapy (bnct) facility, based on a dt neutron generator, with the final goal to find out a potential, alternative, solution to existing bnct treatment facilities which are based on nuclear reactors is examined. materials and methods: with the aim of the mcnp4b monte carlo code different beam-shaping assembly (bsa) configurations were considered. lead was sel...

We detail several methods used in the production of pseudorandom numbers for scalable systems. We will focus on methods based on parameterization, meaning that we will not consider splitting methods. We describe parameterized versions of the following pseudorandom number generation: 1. linear congruential generators 2. linear matrix generators 3. shift-register generators 4. lagged-Fibonacci ge...

The need of software-flexible stream ciphers has led to several alternative proposals in the last few years. One of them is a new Pseudo Random Number Generator (PRNG), named N-adic Summation-Shrinking (NSumSG), which architecture is described in this paper. It uses N-1 parallel working slave summation generators and one N-adic summation generator, controlling the nonlinearity in the generator....

In this paper we argue that hand-writing a program generator generator has a number of advantages compared to generating a program generator generator by self-application of a partial evaluator. We show the basic principles of how to construct a program generator generator by presenting a program generator generator for a skeletal language, and we argue that it is not more difficult to use the ...

it is shown that there are exactly seventy-eight 3-generator 2-groups of order $2^{11}$ with trivial schur multiplier. we then give 3-generator, 3-relation presentations for forty-eight of them proving that these groups have deficiency zero.

De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over n-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping n− 1 to n bit strings), can be distinguished from the uniform distribution with advantage by a circuit of size O(2 2). We generalize this result, showing that a distribution which has less than k bits of ...

Today we will study some conditions under which a very powerful pseudorandom generator can be shown to exist, and also some consequences of the existence of such a pseudorandom generator. We will start by assuming the existence of a permutation p : {0, 1}n → {0, 1}n which is computable in poly(n) time and which, for some constant δ > 0, is (2δn, 2−δn)-one way. (This is an extremely strong assum...