检索结果-南通市图书馆

Impossible Differential Cryptanalysis of Reduced-Round ARIA and Camellia

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2007年第3期22卷 449-456页

作者：吴文玲张文涛冯登国 state key laboratory of information security Institute of Software Chinese Academy of Sciences state key laboratory of information security Graduate University of Chinese Academy of Sciences

This paper studies the security of the block ciphers ARIA and Camellia against impossible differential cryptanalysis. Our work improves the best impossible differential cryptanalysis of ARIA and Camellia known so far. The designers of ARIA expected no impossible differentials exist for 4-round ARIA. However, we found some nontrivial 4-round impossible differentials, which may lead to a possible attack on 6-round ARIA. Moreover, we found some nontrivial 8-round impossible differentials for Camellia, whereas only 7-round impossible differentials were previously known. By using the 8-round impossible differentials, we presented an attack on 12-round Camellia without FL/FL^-1 layers.

关键词： block cipher ARIA Camellia data complexity time complexity impossible differential cryptanalysis

PARAMETRIC EQUATION SOLVING AND QUANTIFIER ELIMINATION IN FINITE FIELDS WITH THE CHARACTERISTIC SET METHOD

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2012年第4期25卷 778-791页

作者： Zhenyu HUANG state key laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

For a parametric algebraic system in finite fields, this paper presents a method for computing the cover and the refined cover based on the characteristic set method. From the cover, the author knows for what parametric values the system has solutions and at the same time presents the solutions in the form of proper chains. By the refined cover, the author gives a complete classification of the number of solutions for this system, that is, the author divides the parameter space into several disjoint components, and on every component the system has a fix number of solutions. Moreover, the author develops a method of quantifier elimination for first order formulas in finite fields.

关键词： Characteristic set method finite field parametric equation system quantifier elimination.

A Generic Framework for Anonymous Authentication in Mobile Networks

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2013年第4期28卷 732-742页

作者：徐静朱文涛 state key laboratory of information security Institute of Information Engineering Chinese Academy of Sciences

Designing an anonymous user authentication scheme in global mobility networks is a non-trivial task because wireless networks are susceptible to attacks and mobile devices powered by batteries have limited communication, processing and storage capabilities. In this paper, we present ~ generic construction that converts any existing secure password authen- tication scheme based on a smart card into an anonymous authentication scheme for roaming services. The security proof of our construction can be derived from the underlying password authentication scheme employing the same assumptions. Compared with the original password authentication scheme, the transformed scheme does not sacrifice the authentication efficiency, and additionally, an agreed session key can be securely established between an anonymous mobile user and the foreign agent in charge of the network being visited. Furthermore, we present an instantiation of the proposed generic construction. The performance analysis shows that compared with other related anonymous authentication schemes, our instantiation is more efficient.

关键词： wireless security roaming service user anonymity password authentication key agreement

VNF-FG design and VNF placement for 5G mobile networks

在线全文

学校读者我要写书评

暂无评论

Science China(information Sciences) 2017年第4期60卷 17-31页

作者： Jiuyue CAO Yan ZHANG Wei AN Xin CHEN Jiyan SUN Yanni HAN state key laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

Network function virtualization(NFV) is envisioned as one of the critical technologies in 5thGeneration(5G) mobile networks. This paper investigates the virtual network function forwarding graph(VNFFG) design and virtual network function(VNF) placement for 5G mobile networks. We first propose a two-step method composed of flow designing and flow combining for generating VNF-FGs according to network service requests. For mapping VNFs in the generated VNF-FG to physical resources, we then modify the hybrid NFV environment with introducing more types of physical nodes and mapping modes for the sake of completeness and practicality, and formulate the VNF placement optimization problem for achieving lower bandwidth consumption and lower maximum link utilization simultaneously. To resolve this problem, four genetic algorithms are proposed on the basis of the frameworks of two existing algorithms(multiple objective genetic algorithm and improved non-dominated sorting genetic algorithm). Simulation results show that Greedy-NSGA-II achieves the best performance among our four algorithms. Compared with three non-genetic algorithms(random, backtracking mapping and service chains deployment with affiliation-aware), Greedy-NSGA-II reduces 97.04%, 87.76% and88.42% of the average total bandwidth consumption, respectively, and achieves only 13.81%, 25.04% and 25.41%of the average maximum link utilization, respectively. Moreover, using our VNF-FG design method and GreedyNSGA-II together can also reduce the total bandwidth consumption remarkably.

关键词： network function virtualization VNF-FG design VNF placement multi-objective optimization genetic algorithm

Image composite authentication using a single shadow observation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2015年第9期58卷 122-134页

作者： CAO XiaoChun ZHAO HanDong WANG Chuan ZHANG Wei state key laboratory of information security Institute of Information Engineering Chinese Academy of Sciences

The paper presents a novel method for image composite authentication based on a single shadow in an outdoor image. Existing methods based on the shadow geometry consistency involve more than two shadow observations. We relax the requirement of two shadow observations in the same scene. As a trade-off,we use the information in EXIF(Exchangeable Image File) based on which the ground truth sun elevation is calculated. We also estimate the sun elevation based on geometric constraints the scene provides, whose consistency serves as the cue to authenticate image forgery. It is the first attempt, to our best knowledge, to make use of sun elevation with shadow of one object to authenticate outdoor images. Also, the novel use of GPS(Global Positioning System), and Date and Time data of captured image makes image forensics possible even in one image containing a single shadow. Experimental results on both the synthetic data and visually plausible images demonstrate the performance of the proposed method.

关键词： image forensics solar shadow sun elevation exchangeable image file geometry-based technique

Real-world traffic analysis and joint caching and scheduling for in-RAN caching networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2017年第6期60卷 176-190页

作者： Zejue WANG Hongjia LI Zhen XU state key laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

This paper analyzes the traffic of a current LTE network in China and investigates the joint optimization of content object caching and scheduling for in-radio access network(RAN) caches. Cooperative caching has been well recognized as a way of unleashing the ultimate potential of in-RAN caches, yet its feasibility is still unexplored. Moreover, content object caching and scheduling are two key issues for cache deployment,which are usually jointly considered and resolved. However, they are triggered by different events with different time granularities. Therefore, on the basis of the real-world dataset, the feasibility of in-RAN cooperative caching is proved from aspects of network topology, traffic load difference among small base stations(SBSs)and correlation analysis of content objects requested at different SBSs. Then, it is verified that different time scales should be considered in making content object caching and scheduling decisions. To exploit in-RAN cooperative caching while meeting the time scale requirement in making caching and scheduling decisions, an optimization problem is constructed considering practical transmission constraints in wireless and backhaul. It is proved to be a quadratic assignment problem, and then, a joint caching, and wireless and backhaul scheduling algorithm is proposed based on Lagrangian relaxation and decomposition, and hastening branch and *** performance of the proposed algorithm is evaluated based on the real-world dataset. Results depict the relationship among the cache capacity, the number of SBSs, the connection probability of SBSs and the objective performance, and show that the proposed algorithm can achieve better performance, compared with the existing algorithms.

关键词： 5G mobile edge caching mobile traffic analysis optimization cooperative caching

A MATRIX CONSTRUCTION OF BOOLEAN FUNCTIONS WITH MAXIMUM ALGEBRAIC IMMUNITY

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2012年第4期25卷 792-801页

作者： Yonghong XIE Lei HU state key laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

Boolean functions used in a cryptographic system should have high algebraic immunity to resist algebraic attacks. This paper presents a matrix method for constructing balanced Boolean functions achieving maximum algeb... 详细信息

关键词： Algebraic immunity block upper triangular matrix Boolean function.

Effect on ion-trap quantum computers from the quantum nature of the driving field

在线全文

学校读者我要写书评

暂无评论

Science China(information Sciences) 2020年第10期63卷 219-233页

作者： Biyao YANG Li YANG state key laboratory of information security Institute of Information EngineeringChinese Academy of Sciences state key laboratory of Cryptology School of Cyber security University of Chinese Academy of Sciences

In this study, we evaluate the effect on ion-trap quantum computers（QCs） from the quantum nature of the driving field, and propose a theoretical limit for ion-trap QCs that may impact the design of quantum algorithms and realization of practical QCs. We obtain, for the first time, the permitted depth of logical operation for fault-tolerant ion-trap QCs. Physically, we provide an exact（full-quantum） description of the QC system, and present for the first time its time evolution after gate operations; mathematically,we solve problems such as certain summations of trigonometric series with any given precision. Comparing the actual state after CNOT gates driven by a quantized field with the expected state, we obtain the failure probability and estimate that the number of CNOT gates on the same pair of physical qubits is not more than 10;in one error-correction period, which is a physical limit that cannot be easily overcome. The conclusion can help determine the number of CNOT operations between coding and decoding in one error-correction period and can be used as a reference for quantum algorithm design.

关键词： quantum computing ion-trap quantum algorithm fault-tolerant quantum computation threshold theorem permitted depth of logical operation

Rényi divergence on learning with errors

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2020年第9期63卷 124-139页

作者： Yang TAO Han WANG Rui ZHANG state key laboratory of information security Institute of Information EngineeringChinese Academy of Sciences School of Cyber security University of Chinese Academy of Sciences

Many lattice-based schemes are built from the hardness of the learning with errors problem, which naturally comes in two flavors: the decision LWE and search LWE. In this paper, we investigate the decision LWE and search LWE by Rényi divergence respectively and obtain the following results: For decision LWE,we apply RD on LWE variants with different error distributions(i.e., center binomial distribution and uniform distribution, which are frequently used in the NIST PQC submissions) and prove the pseudorandomness in theory. As a by-product, we extend the so-called public sampleability property and present an adaptively public sampling property to the application of Rényi divergence on more decision problems. As for search LWE, we improve the classical reduction proof from Gap SVP to LWE. Besides, as an independent interest,we also explore the intrinsic relation between the decision problem and search problem.

关键词： Rényi divergence learning with errors decision problems search problems post-quantum cryptography