A distributed wheel sieve algorithm using Scheduling by Multiple Edge Reversal

Number of pages: 12This paper presents a new distributed approach for generating all prime numbers in a given interval of integers. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the current generation of parallel computers, which have permitted to reach larger bounds on the interval or to obtain previous results in a shorter time, prime numbers generation still represents an attractive domain of research and plays a central role in cryptography. We propose a fully distributed algorithm for finding all primes in the interval $[2\ldots, n]$, based on the \emph{wheel sieve} and the SMER (\emph{Scheduling by Multiple Edge Reversal}) multigraph dynamics. Given a multigraph $\mathcal{M}$ of arbitrary topology, having $N$ nodes, an SMER-driven system is defined by the number of directed edges (arcs) between any two nodes of $\mathcal{M}$, and by the global period length of all ''arc reversals'' in $\mathcal{M}$. The new prime number generation method inherits the distributed and parallel nature of SMER and requires at most $n + \lfloor \sqrt{n}\rfloor$ time steps

A distributed prime sieving algorithm based on SMER

Rapport interne LIPNIn this paper, we propose a fully distributed algorithm for finding all primes in an given interval $[2..n]$ (or $(L,R)$, more generally), based on the SMER (\textit{Scheduling by Multiple Edge Reversal}) multigraph dynamics. Given a multigraph $\mathcal{M}$ of arbitrary topology, having $N$ nodes, the SMER-driven system is defined by the numberof directed edges (arcs) between any two nodes of $\mathcal{M}$, and by the global period length of all ``arc reversals'' in $\mathcal{M}$. In the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving algorithms of an entirely original design. The maximum number of steps required by the algorithm is at most $n + \sqrt{n}$. Although far beyond the $O(n/\log\log n)$ steps required by the improved sequential ``wheel sieve'' algorithms, our SMER-based algorithm is fully distributed and of linear (step) complexity. The message complexity of the algorithm is at most $n\Delta_N + \sqrt{n} \Delta_N$, where $\Delta_N$ denotes the maximum ``multidegree'' of the arbitrary multigraph $\mathcal{M}$, and the space required per process is linear

Towards Type-Based Optimizations in Distributed Applications Using ABS and JAVA 8

In this paper we present an API to support modeling applications with Actors based on the paradigm of the Abstract Behavioural Specification (ABS) language. With the introduction of JAVA 8, we expose this API through a JAVA library to allow for a high-level actor-based methodology for programming distributed systems which supports the programming to interfaces discipline. We validate this solution through a case study where we obtain significant performance improvements as well as illustrating the ease with which simple high and low-level optimizations can be obtained by examining topologies and communication within an application. Using this API we show it is much easier to observe drawbacks of shared data-structures and communications methods in the design phase of a distributed application and apply the necessary corrections in order to obtain better results

RASCP: Providing for a Secure Group Communication Plane Using RFID

Predominantly large distributed networks currently provide support for group oriented protocols and applications Regardless of the type of distributed network there is a need to provide communication privacy and data integrity to the information exchange amongst the group members This paper introduces a protocol named Authentication based Secure Communication Plane adopts the commutative RSA algorithm to maintain data integrity The proposed protocol not only eliminates the overheads resulting from key distribution and key compromise attacks but also provide for information security in the presence of colluded group members Radio Frequency Identification tags is used for group member identification The RACP protocol is compared with the RFID extended Secure Lock group communication protocol and its efficiency in terms of the computational complexity involved is discussed in this pape

Secure Communication Protocols, Secret Sharing and Authentication Based on Goldbach Partitions

This thesis investigates the use of Goldbach partitions for secure communication protocols and for finding large prime numbers that are fundamental to these protocols. It is proposed that multiple third parties be employed in TLS/SSL and secure communication protocols to distribute the trust and eliminate dependency on a single third party, which decreases the probability of forging a digital certificate and enhances the overall security of the system. Two methods are presented in which the secret key is not compromised until all third parties involved in the process are compromised. A new scheme to distribute secret shares using two third parties in the piggy bank cryptographic paradigm is proposed. Conditions under which Goldbach partitions are efficient in finding large prime numbers are presented. A method is also devised to sieve prime numbers which uses less number of operations as compared to the Sieve of Eratosthenes.Electrical Engineerin

The Challenge of Human Mesenchymal Stromal Cell Expansion: Current and Prospective Answers

In the field of cell therapy, allogenic human mesenchymal stromal cells (hMSCs) are often used in clinical trials, creating a demand for cell mass production using efficient dynamic bioreactor systems. As an advanced therapy medicinal product (ATMP), such cells should meet certain special requirements, including product specifications requiring a production process compatible with good manufacturing practice (GMP). The development of processes in which the cells are the product therefore remains a significant challenge. This chapter describes the requirements at different steps in the upstream and downstream phases of such dynamic processes. Potential solutions are presented and future prospects are discussed, including the selection of media and carriers for the strictly adherent growing cells, allowing efficient cell adhesion and detachment. Strategies for dynamic cultivation in bioreactors are described in detail for fixed‐bed and stirred‐tank reactors based on GMP requirements and the integration of process analytical technology (PAT). Following cell harvest, separation and purification, the formulation and storage of the product are also described. Finally, the chapter covers important cell quality characteristics necessary for the approval of ATMPs