Computing on the joint quadratic complexity of multiple periodic sequences

您当前的位置：

首页 >

文章列表页 >

academic paper | 更新时间：2024-06-05

- Computing on the joint quadratic complexity of multiple periodic sequences
- Journal on Communications Vol. 33, Issue 6, Pages: 11-18(2012)
- 作者机构：
  
  西安电子科技大学计算机网络与信息安全教育部重点实验室，陕西西安710071
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(60833008);The National Natural Science Funds of China for Young Scholar(61100235);The Natural Science Basic Research Plan in Shaanxi Province of China(2009JQ8005);The 111 Project(B08038)
- DOI：1000-436X(2012)06-0011-08
  CLC： TP309
- Online First：2012-06，
  
  Published：25 June 2012
- 稿件说明：
移动端阅览
Li-hua DONG, Yu-pu HU, Yong ZENG. Computing on the joint quadratic complexity of multiple periodic sequences[J]. Journal on Communications, 2012, 33(6): 11-18.
DOI：

Li-hua DONG, Yu-pu HU, Yong ZENG. Computing on the joint quadratic complexity of multiple periodic sequences[J]. Journal on Communications, 2012, 33(6): 11-18. DOI： 1000-436X(2012)06-0011-08.

Views

858

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Review of algebraic attacks on stream ciphers

Primitive polynomials and word oriented linear feedback shift registers

Concrete constructions of 2-resilient rotation symmetric Boolean functions with 7 variables

Survey on approaches of stream cipher cryptanalysis

Constructions of rotation symmetric 2-resilient functions with 4t_-1 number of variables

Related Author

ZHANG Long1

WU Wen-ling2

WEN Qiao-yan1

YANG Yang

ZENG Guang

HAN Wen-bao

FAN Shu-qin

Lin LI

Related Institution

School of Science,Beijing University of Posts and Telecommunications

PLA Information Engineering University

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

College of Mathematics and Information Science,Henan Normal University

Faculty of Mathematical Sciences, Luoyang Normal University

AI导读

AI问答

⁰