In this paper we present sorting algorithms on the re-a network with diameter 4 p N , 3 consisting of N connected meshes of size p N p N. We show that k-k sorting can be done in 8 p N + ON 1 3 steps for k = 1; 2; 3; 4 and in 2k p N + OkN 1 3 steps for k 4 with constant buffersize for all k. We show how our algorithms can be modified to achieve 4 p N+ON 1 3 steps for k = 1 ; 2; 3; 4 and k p N+OkN 1 3 steps for k 4 in the average case. Finally we show a lower bound of maxf4 p N ; 1 p 2 k p Ng steps for k-k sorting.

True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. In this work, we introduce, extend and analyse the concept of the randomised bit cell (RBC), introducing a second meta-level of randomisation, being able to simultaneously produce random numbers and detect active non-intrusive attacks. The concept is extended by using a corrector. Meta-stability is one way to generate true random numbers. By using electromagnetic radiation, a flip-flop (ff) in a meta-stable state can be manipulated to a known state. We clarify and comprehend open issues of meta-stable ffs such as power consumption and electromagnetic field strength. The experimental comparison though a software simulation with a standard TRNG yields a 17.69 times better distribution of zeros and ones while the TRNGs are under attack at the expense of a delay which is proportional to the quality of the random source.

No abstract

Component updates always imply the risk of negatively influencing the operability of software systems. Because of wrong combinations of component versions, dependencies might break, methods which do no longer exist, might be called or methods might not be compatible to provided interfaces, objects, or classes. In this paper we model the problem of finding a well-configured system consisting of multiple component versions as a Boolean Optimization Problem. We introduce objective functions and constraints, which use Branch-and-Bound for restricting the search space and yield most recent, minimal systems.

No abstract