Hierarchichal Approaches for multicast based on the Euclid's algorithm

Abstract

The aim of this work is to show how properties of the Euclid's approach combined with the hierarchical tree approach gives rise to a powerful method that allows to multicast messages in environment with huge and highly dynamic audiences with very low communication overcomes, including the length of the rekeying messages. We will show also how the use of Euclid's approach becomes natural in some hierarchical tree situations from the properties of the prime numbers, certainly the key of this method.