IET Inf. Secur.最新文献_第4页

BDD-based cryptanalysis of stream cipher: a practical approach 基于bdd的流密码分析:一种实用的方法

IET Inf. Secur. Pub Date : 2017-04-27 DOI: 10.1049/iet-ifs.2016.0076

H. Sahu, Indivar Gupta, N. R. Pillai, R. Sharma

引用次数: 2

Analysis of permutation choices for enhanced generalised Feistel structure with SP-type round function 具有sp型圆函数的增强广义Feistel结构的排列选择分析

IET Inf. Secur. Pub Date : 2017-04-27 DOI: 10.1049/iet-ifs.2015.0433

Lei Zhang, Wenling Wu

引用次数: 2

Searching all truncated impossible differentials in SPN 搜索SPN中所有截断的不可能微分

IET Inf. Secur. Pub Date : 2017-03-06 DOI: 10.1049/iet-ifs.2015.0052

Ting Cui, Chenhui Jin, Bin Zhang, Zhuo Chen, Guoshuang Zhang

{"title":"Searching all truncated impossible differentials in SPN","authors":"Ting Cui, Chenhui Jin, Bin Zhang, Zhuo Chen, Guoshuang Zhang","doi":"10.1049/iet-ifs.2015.0052","DOIUrl":"https://doi.org/10.1049/iet-ifs.2015.0052","url":null,"abstract":"This study concentrates on finding all truncated impossible differentials in substitution-permutation networks (SPNs) ciphers. Instead of using the miss-in-the-middle approach, the authors propose a mathematical description of the truncated impossible differentials. First, they prove that all truncated impossible differentials in an r\u0000 + 1 rounds SPN cipher could be obtained by searching entry `0' in D\u0000(\u0000 P\u0000)\u0000 r\u0000, where D\u0000(\u0000 P\u0000) denotes the differential pattern matrix (DPM) of P\u0000-layer, thus the length of impossible differentials of an SPN cipher is upper bounded by the minimum integer r\u0000 such that there is no entry `0' in D\u0000(\u0000 P\u0000)\u0000 r\u0000. Second, they provide two efficient algorithms to compute the DPMs for both bit-shuffles and matrices over GF(2\u0000 n\u0000). Using these tools they prove that the longest truncated impossible differentials in SPN structure is 2-round, if the P\u0000-layer is designed as an maximum distance separable (MDS) matrix. Finally, all truncated impossible differentials of advanced encryption standard (AES), ARIA, AES-MDS, PRESENT, MAYA and Puffin are obtained.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"76 1","pages":"89-96"},"PeriodicalIF":0.0,"publicationDate":"2017-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86174940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

High-performance and high-speed implementation of polynomial basis Itoh-Tsujii inversion algorithm over GF(2 m ) GF(2m)上多项式基Itoh-Tsujii反演算法的高性能高速实现

IET Inf. Secur. Pub Date : 2017-03-01 DOI: 10.1049/iet-ifs.2015.0461

Bahram Rashidi, R. R. Farashahi, S. Sayedi

引用次数: 23

Hybrid mechanism towards network packet early acceptance and rejection for unified threat management 网络数据包早期接受和拒绝的混合机制，统一威胁管理

IET Inf. Secur. Pub Date : 2017-03-01 DOI: 10.1049/iet-ifs.2015.0246

Z. Trabelsi, S. Zeidan, M. Masud

{"title":"Hybrid mechanism towards network packet early acceptance and rejection for unified threat management","authors":"Z. Trabelsi, S. Zeidan, M. Masud","doi":"10.1049/iet-ifs.2015.0246","DOIUrl":"https://doi.org/10.1049/iet-ifs.2015.0246","url":null,"abstract":"Recent network architectures utilise many types of security appliances to combat blended attacks. However, managing multiple separate security appliances can be overwhelming, inefficient and expensive. Thus, multiple security features are needed to be integrated into unified security architecture resulting in an unified threat management system (UTM). In most current UTM systems, whenever a security feature is needed, the corresponding module is just ‘attached or added on’. This approach of adding on may reduce the UTM performance dramatically, especially when security features such as IDS/IPS are enabled. In this study, a hybrid mechanism is proposed to solve UTM redundant packet classification problem. The mechanism is based on the use of splay tree filters and pattern-matching algorithms to enhance packet filtering and deep packet inspection (DPI) performance. The proposed mechanism uses network traffic statistics to dynamically optimise the order of the splay tree filters, allowing early acceptance and rejection of network packets. In addition, DPI signature rules are reordered according to their matching frequencies, allowing early packets acceptance. The authors demonstrate the merit of their mechanism through simulations performed on firewall and snort as independent packet manipulation systems compared with the proposed hybrid mechanism that uses unified communication between them.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"1 1","pages":"104-113"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89960395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Lightweight and integrity-protecting oriented data aggregation scheme for wireless sensor networks 面向轻量级和完整性保护的无线传感器网络数据聚合方案

IET Inf. Secur. Pub Date : 2017-03-01 DOI: 10.1049/iet-ifs.2015.0387

Xiaomin Zhao, Jiabin Zhu, Xueli Liang, Shuangshuang Jiang, Q. Chen

{"title":"Lightweight and integrity-protecting oriented data aggregation scheme for wireless sensor networks","authors":"Xiaomin Zhao, Jiabin Zhu, Xueli Liang, Shuangshuang Jiang, Q. Chen","doi":"10.1049/iet-ifs.2015.0387","DOIUrl":"https://doi.org/10.1049/iet-ifs.2015.0387","url":null,"abstract":"In recent years, some research used classical and heavyweight encryption technology to realise data privacy and integrity protection in data aggregation of wireless sensor networks. The challenge is the balance between resource constraints and the complexity of the deployment. In this study, the authors proposed a lightweight and integrity-protecting oriented data aggregation scheme for wireless sensor networks (LIPDA) which has lightweight, secure and easy operability to preserve data privacy and integrity during data aggregation in wireless sensor network. First, a distance-based formation scheme of network topology is presented to balance the energy consumption of cluster heads. Then, a structure of complex number, which composes from the private factor of the nodes and the original data, is composed. The complex number is encrypted by additive homomorphic encryption method, which can realise the data aggregation without any decryption. Also, the reliability of data is ensured by using integrity verification method based on the complex operation. The theoretical analysis and simulation results show that the proposed scheme LIPDA can meet the requirement of privacy protection. Moreover, compared with related work, LIPDA has lower calculation, less traffic, higher accuracy and verifiable completeness.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"79 1","pages":"82-88"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83800441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Highly nonlinear plateaued functions 高度非线性的稳定函数

IET Inf. Secur. Pub Date : 2017-03-01 DOI: 10.1049/iet-ifs.2016.0131

T. Cusick

引用次数: 7

Design of new scan orders for perceptual encryption of H.264/AVC videos H.264/AVC视频感知加密新扫描顺序设计

IET Inf. Secur. Pub Date : 2017-03-01 DOI: 10.1049/iet-ifs.2015.0492

Xiangling Ding, Y. Deng, Gaobo Yang, Yun Song, Dajiang He, Xingming Sun

引用次数: 10

Improved meet-in-the-middle attacks on Crypton and mCrypton 改进了对Crypton和mCrypton的中间相遇攻击

IET Inf. Secur. Pub Date : 2017-03-01 DOI: 10.1049/iet-ifs.2015.0518

Rongjia Li, Chenhui Jin

引用次数: 2

Back-propagation neural network on Markov chains from system call sequences: a new approach for detecting Android malware with system call sequences 基于系统调用序列的马尔可夫链反向传播神经网络:一种基于系统调用序列检测Android恶意软件的新方法

IET Inf. Secur. Pub Date : 2017-01-16 DOI: 10.1049/iet-ifs.2015.0211

Xi Xiao, Zhenlong Wang, Qing Li, Shutao Xia, Yong Jiang

{"title":"Back-propagation neural network on Markov chains from system call sequences: a new approach for detecting Android malware with system call sequences","authors":"Xi Xiao, Zhenlong Wang, Qing Li, Shutao Xia, Yong Jiang","doi":"10.1049/iet-ifs.2015.0211","DOIUrl":"https://doi.org/10.1049/iet-ifs.2015.0211","url":null,"abstract":"Android has become the most prevalent mobile system, but in the meanwhile malware on this platform is widespread. System call sequences are studied to detect malware. However, malware detection with these approaches relies on common system-call-subsequences. It is not so efficient because it is difficult to decide the appropriate length of the common subsequences. To address this issue, the authors propose a new approach, back-propagation neural network on Markov chains from system call sequences (BMSCS). It treats one system call sequence as a homogeneous stationary Markov chain and applies back-propagation neural network (BPNN) to detect malware by comparing transition probabilities in the chain. Since transition probabilities from one system call to another in malware are significantly different from those in benign applications, BMSCS can efficiently detect malware by capturing the anomaly in state transitions with the help of BPNN. The authors evaluate the performance of BMSCS by experiments with real application samples. The experiment results show that the F \u0000-score of BMSCS achieves up to 0.982773, which is higher than the other methods in the literature.","PeriodicalId":13305,"journal":{"name":"IET Inf. Secur.","volume":"1 1","pages":"8-15"},"PeriodicalIF":0.0,"publicationDate":"2017-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89705308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 49