一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級(jí)搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問(wèn)題, 您可以本頁(yè)添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號(hào)碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

基于模2pm的歐拉商的二元序列的線性復(fù)雜度

杜小妮 李麗 張福軍

杜小妮, 李麗, 張福軍. 基于模2pm的歐拉商的二元序列的線性復(fù)雜度[J]. 電子與信息學(xué)報(bào), 2019, 41(12): 3000-3005. doi: 10.11999/JEIT190071
引用本文: 杜小妮, 李麗, 張福軍. 基于模2pm的歐拉商的二元序列的線性復(fù)雜度[J]. 電子與信息學(xué)報(bào), 2019, 41(12): 3000-3005. doi: 10.11999/JEIT190071
Xiaoni DU, Li LI, Fujun ZHANG. Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo 2pm[J]. Journal of Electronics & Information Technology, 2019, 41(12): 3000-3005. doi: 10.11999/JEIT190071
Citation: Xiaoni DU, Li LI, Fujun ZHANG. Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo 2pm[J]. Journal of Electronics & Information Technology, 2019, 41(12): 3000-3005. doi: 10.11999/JEIT190071

基于模2pm的歐拉商的二元序列的線性復(fù)雜度

doi: 10.11999/JEIT190071
基金項(xiàng)目: 國(guó)家自然科學(xué)基金(61462077, 61562077, 61772022),上海市自然科學(xué)基金(16ZR1411200)
詳細(xì)信息
    作者簡(jiǎn)介:

    杜小妮:女,1972年生,教授,博士生導(dǎo)師,研究方向?yàn)槊艽a學(xué)與信息安全

    李麗:女,1991年生,碩士生,研究方向?yàn)槊艽a學(xué)與信息安全

    張福軍:男,1995年生,碩士生,研究方向?yàn)槊艽a學(xué)與信息安全

    通訊作者:

    李麗 ymxlili36@126.com

  • 中圖分類號(hào): TN918.4

Linear Complexity of Binary Sequences Derived from Euler Quotients Modulo 2pm

Funds: The National Natural Science Foundation of China (61462077, 61562077, 61772022), The Shanghai Municipal Natural Science Foundation (16ZR1411200)
  • 摘要: 基于歐拉商模奇素?cái)?shù)冪構(gòu)造的偽隨機(jī)序列均具有良好的密碼學(xué)性質(zhì)。該文根據(jù)剩余類環(huán)理論,利用模$2{p^m}$($p$為奇素?cái)?shù),整數(shù)$m \ge 1$)的歐拉商構(gòu)造了一類周期為$2{p^{m + 1}}$的二元序列,并在${2^{p - 1}}\not \equiv 1 ({od}\,{p^2})$的條件下借助有限域${F_2}$上確定多項(xiàng)式根的方法,給出了序列的線性復(fù)雜度。結(jié)果表明,序列的線性復(fù)雜度取值為$2({p^{m + 1}} - p)$$2({p^{m + 1}} - 1)$不小于其周期的1/2,能夠抵抗Berlekamp-Massey(B-M)算法的攻擊,是密碼學(xué)意義上性質(zhì)良好的偽隨機(jī)序列。
  • DING Cunsheng, XIAO Guozhen, and SHAN Weijuan. The Stability Theory of Stream Ciphers[M]. Berlin, Heidelberg: Springer-Verlag, 1991: 251–321.
    GOLOMB S W and GONG Guang. Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar[M]. Cambridge, UK: Cambridge University Press, 2005: 174–175.
    SU Wei, YANG Yang, ZHOU Zhengchun, et al. New quaternary sequences of even length with optimal auto-correlation[J]. Science China Information Sciences, 2018, 61(2): 022308. doi: 10.1007/s11432-016-9087-2
    DAI Zongduo, GONG Guang, and SONG H Y. A trace representation of binary Jacobi sequences[J]. Discrete Mathematics, 2009, 309(6): 1517–1527. doi: 10.1016/j.disc.2008.02.024
    CHEN Zhixiong. Linear complexity of Legendre-polynomial quotients[J]. IET Information Security, 2018, 12(5): 414–418. doi: 10.1049/iet-ifs.2017.0307
    李瑞芳, 柯品惠. 一類新的周期為2pq的二元廣義分圓序列的線性復(fù)雜度[J]. 電子與信息學(xué)報(bào), 2014, 36(3): 650–654. doi: 10.3724/SP.J.1146.2013.00751

    LI Ruifang and KE Pinhui. The linear complexity of a new class of generalized cyclotomic sequences with period 2pq[J]. Journal of Electronics &Information Technology, 2014, 36(3): 650–654. doi: 10.3724/SP.J.1146.2013.00751
    杜小妮, 王國(guó)輝, 魏萬(wàn)銀. 周期為2p2的四階二元廣義分圓序列的線性復(fù)雜度[J]. 電子與信息學(xué)報(bào), 2015, 37(10): 2490–2494.

    DU Xiaoni, WANG Guohui, and WEI Wanyin. Linear complexity of binary generalized cyclotomic sequences of order four with period 2p2[J]. Journal of Electronics &Information Technology, 2015, 37(10): 2490–2494.
    杜小妮, 趙麗萍, 王蓮花. Z4上周期為2p2的四元廣義分圓序列的線性復(fù)雜度[J]. 電子與信息學(xué)報(bào), 2018, 40(12): 2992–2997. doi: 10.11999/JEIT180189

    DU Xiaoni, ZHAO Liping, and WANG Lianhua. Linear complexity of quaternary sequences over Z4 derived from generalized cyclotomic classes modulo 2p2[J]. Journal of Electronics &Information Technology, 2018, 40(12): 2992–2997. doi: 10.11999/JEIT180189
    EDEMSKIY V, LI Chunlei, ZENG Xiangyong, et al. The linear complexity of generalized cyclotomic binary sequences of period p n[J]. Designs, Codes and Cryptography, 2019, 87(5): 1183–1197. doi: 10.1007/s10623-018-0513-2
    CHEN Zhixiong and DU Xiaoni. On the linear complexity of binary threshold sequences derived from Fermat quotients[J]. Designs, Codes and Cryptography, 2013, 67(3): 317–323. doi: 10.1007/s10623-012-9608-3
    CHEN Zhixiong and WINTERHOF A. On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients[J]. International Journal of Number Theory, 2012, 8(3): 631–641. doi: 10.1142/S1793042112500352
    DU Xiaoni, KLAPPER A, and CHEN Zhixiong. Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations[J]. Information Processing Letters, 2012, 112(6): 233–237. doi: 10.1016/j.ipl.2011.11.017
    DU Xiaoni, CHEN Zhixiong, and HU Lei. Linear complexity of binary sequences derived from Euler quotients with prime-power modulus[J]. Information Processing Letters, 2012, 112(14/15): 604–609. doi: 10.1016/j.ipl.2012.04.011
    WU Chenhuang, CHEN Zhixiong, and DU Xiaoni. Binary threshold sequences derived from Carmichael quotients with even numbers modulus[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2012, E95.A(7): 1197–1199. doi: 10.1587/transfun.E95.A.1197
    ZHANG Jingwei and ZHAO Changan. Linear complexity and trace presentation of sequences with period 2p2[C]. 2018 IEEE International Symposium on Information Theory, Vail, USA, 2018: 2206–2210. doi: 10.1109/ISIT.2018.8437917.
    AGOH T, DILCHER K, and SKULA L. Fermat quotients for composite moduli[J]. Journal of Number Theory, 1997, 66(1): 29–50. doi: 10.1006/jnth.1997.2162
  • 加載中
計(jì)量
  • 文章訪問(wèn)數(shù):  2440
  • HTML全文瀏覽量:  994
  • PDF下載量:  67
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2019-01-24
  • 修回日期:  2019-06-20
  • 網(wǎng)絡(luò)出版日期:  2019-07-09
  • 刊出日期:  2019-12-01

目錄

    /

    返回文章
    返回