丁广义割圆序列的线性复杂度   总被引：1，自引：0，他引：1  

闫统江  陈智雄  肖国镇 《上海大学学报(英文版)》2007,11(1):22-22

Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q.  相似文献   

一种数字签名,加密和纠错公钥体制     

冯登国  肖国镇 《科技通报》1995,11(3):156-158

根据文献１中提出的ＭｃＥｌｉｅｃｅ公钥体制和文献２中提出的二次布尔公钥体制的思想，设计了一种能实现数字签名、加密和纠错的公钥密码体制。  相似文献   

组合设计和相关免疫性     

冯登国  肖国镇 《科技通报》1994,10(4):232-234

论述了组合设计和相关免疫性之间的关系，并介绍了利用组合设计来构造相关免疫函数的一些方法。  相似文献