《電子技術(shù)應(yīng)用》
您所在的位置:首頁 > 其他 > 設(shè)計應(yīng)用 > 基于單因素方差分析的密碼算法統(tǒng)計檢驗
基于單因素方差分析的密碼算法統(tǒng)計檢驗
2021年電子技術(shù)應(yīng)用第9期
朱玉倩,王 超,張 艷
華北計算機(jī)系統(tǒng)工程研究所,北京100083
摘要: 在密碼學(xué)范疇中,隨機(jī)序列常作為密鑰、初始向量或算法參數(shù)使用。隨機(jī)序列的隨機(jī)性最終決定了整個密碼系統(tǒng)的安全性,因此在密碼技術(shù)中占有重要位置。對于良好的密碼算法產(chǎn)生的密文序列,應(yīng)無法通過統(tǒng)計學(xué)方法進(jìn)行區(qū)分。首先對7種經(jīng)典密碼算法生成的密文序列進(jìn)行NIST隨機(jī)性檢驗,統(tǒng)計失敗次數(shù);然后關(guān)于密碼算法進(jìn)行單因素方差分析,檢驗結(jié)果在統(tǒng)計學(xué)上無顯著差異。此統(tǒng)計檢驗可作為評價密碼算法好壞的指標(biāo)之一。
中圖分類號: TP309.7
文獻(xiàn)標(biāo)識碼: A
DOI:10.16157/j.issn.0258-7998.211329
中文引用格式: 朱玉倩,王超,張艷. 基于單因素方差分析的密碼算法統(tǒng)計檢驗[J].電子技術(shù)應(yīng)用,2021,47(9):43-45,50.
英文引用格式: Zhu Yuqian,Wang Chao,Zhang Yan. Statistical test of cryptographic algorithms based on ANOVA[J]. Application of Electronic Technique,2021,47(9):43-45,50.
Statistical test of cryptographic algorithms based on ANOVA
Zhu Yuqian,Wang Chao,Zhang Yan
National Computer System Engineering Research Institute of China,Beijing 100083,China
Abstract: In the field of cryptography, a random sequence is often used as a key, an initial vector or a time-varying parameter in cryptographic protocol. Actually, the randomness of a random sequence plays a very important role in the cryptography, since it determines the security of the whole system. The ciphertext sequence generated by a good cryptographic algorithm should not be distinguished by statistical methods. In this paper, we count the number of failures by using the national institute of standards and technology(NIST), which is executed on the ciphertext sequences generated by seven classic cryptographic algorithms. The analysis shows that the results are not statistically significant. Thus, the statistical test used in the paper can be used as one of the indicators to evaluate the quality of cryptographic algorithms.
Key words : one way analysis of variance;cryptographic algorithms;statistical test;national institute of standards and technology(NIST) randomness test

0 引言

    在密碼學(xué)領(lǐng)域,主要使用對稱密碼算法對信息進(jìn)行加密,保障信息的機(jī)密性。隨著密碼分析技術(shù)的進(jìn)步和敵手攻擊能力的提升,加密密碼算法的設(shè)計要求不斷提高。分析與識別保密系統(tǒng)所采用的密碼算法,對于評估信息系統(tǒng)安全性、密碼分析和攻擊、非法通信監(jiān)控、惡意代碼識別等都有著重要的理論意義[1]

    近幾年加密算法生成密文的檢驗領(lǐng)域成果層出不窮,王瑛[2]等人結(jié)合人工智能技術(shù)和機(jī)器學(xué)習(xí)方法,研究和設(shè)計了網(wǎng)絡(luò)加密流量檢測體系框架和方法。吳楊[3-4]等人通過NIST隨機(jī)性檢測標(biāo)準(zhǔn)中的單比特頻數(shù)檢驗、塊內(nèi)頻數(shù)檢驗和游程檢驗理論設(shè)計統(tǒng)計量,對OpenSSL軟件庫中的AES、Camellia、DES、3DES和作者實現(xiàn)的SM4分組密碼算法生成的200組、每組1萬條密文進(jìn)行分析,實現(xiàn)上述5種分組密碼算法的識別。




本文詳細(xì)內(nèi)容請下載:http://ihrv.cn/resource/share/2000003743。




作者信息:

朱玉倩,王  超,張  艷

(華北計算機(jī)系統(tǒng)工程研究所,北京100083)




wd.jpg

此內(nèi)容為AET網(wǎng)站原創(chuàng),未經(jīng)授權(quán)禁止轉(zhuǎn)載。