A parallel algorithm for secure multicast

Abstract

In this work, we introduce algorithms to speedup and to scale a classical secure multicast protocol that currently goes unused due to its computational and data management requirements when the audience becomes large. This is in spite of its agreeable cryptographic properties, which offers real applicability. A core component of such an algorithm is the well-known method to solve congruent systems, the Chinese remainder algorithm (CRA). This work presents the study, design and implementation of a software approach to the CRA on different parallel architectures. Special attention is placed on big integers, which affect method performance, given that the system is more secure as the modules become larger. This problem leads to the design of a new and more efficient method to address these issues in a scalable way. The results represent an enhancement in efficiency, performance and scalability when compared to existing alternatives.