中文摘要：

固定的关键问题多点传送是产生，散布并且更新会议加密钥匙(SEK ) 。有多种子(MPE ) 的多项式扩大计划是基于多项式扩大(PE ) 的一条途径计划并且克服 PE “ s 缺乏。它的操作被使用多种子表明，组成员被划分到许多亚群。当更新 SEK 时，计算仅仅在亚群之一被需要，其它将他们使用计算历史更新他们的 SEK。设计申请包括发现可行的方法的一个 MPE 计划的关键问题工作象一样产生一个严格的素数(SPN ) 。有多种子和计算历史概念的那些技术在实际应用作为一种好选择做 MPE。一个原型测试系统被设计，所有上面提及的问题的答案在这篇建议论文被包括。

英文摘要：

The key problem of securing multieast is to generate, distribute and update Session Encryption Key（SEK）. Polynomial expansion with multi-seed （MPE） scheme is an approach which is based on Polynomial expansion （PE） scheme and overcomes PE＇s shortage. Its operation is demonstrated by using multi-seed, the group member is partitioned to many subgroups. While updating the SEK, computation is needed only in one of subgroups, the other of them will use the computation history to update their SEK. The key problems to design a MPE scheme application includes to find a feasible one way function as well as to generate a Strict Prime Number （SPN）. Those technologies with multi-seed and computation history concepts make MPE as a good choice in practical applications. A prototype test system is designed and solutions of all above mentioned problems are included in this proposed paper.