CRAFT算法基于比特可分性的积分区分器搜索

CRAFT算法是一种新型SPN结构的类AES型轻量级可调分组密码算法,可以有效地抵抗差分故障攻击.为了对CRAFT算法抵抗积分攻击的能力进行评估,采用基于混合整数线性规划(MILP)的方法自动化搜索比特可分性的工具,对CRAFT算法的积分区分器进行搜索,搜索到了最长为12轮的积分区分器,同时得到一条平衡比特数最多的9轮...     

基于比特可分性的PRIDE和RoadRunneR积分区分器搜索

PRIDE和RoadRunneR是近几年提出的两种轻量级分组密码算法,在2016 亚密会上,向泽军等人提出利用基于比特可分性的MILP（混合整数线性规划）模型搜索积分区分器。利用该思想,针对两种不同类型的轻量级分组密码算法,为了评估该算法积分性质,验证新方法的实用性,根据其不同密码算法结构分别建立MILP模型,利用Gurobi优化器求解此模型,搜索可用的积分区分器。结果分别得到9轮和5轮的积分区分器,是PRIDE和RoadRunneR目前已知最长的积分区分器,利用该区分器可进行更多轮的积分攻击。     

基于MILP搜索的ANU算法积分分析

ANU算法是由Bansod等人发表在SCN 2016上的一种超轻量级的Feistel结构的分组密码算法。截至目前,没有人提出针对该算法的积分攻击。为了研究ANU算法抗积分攻击的安全性,根据ANU算法的结构建立起基于比特可分性的MILP模型。对该模型进行求解,首次得到ANU算法的9轮积分区分器;利用搜索到的9轮区分器以及轮密钥之间的相关性,对128 bit密钥长度的ANU算法进行12轮密钥恢复攻击,能够恢复43 bit轮密钥。该攻击的数据复杂度为2^63.58个选择明文,时间复杂度为2^88.42次12轮算法加密,存储复杂度为2³³个存储单元。     

对PICO算法基于可分性的积分攻击

对近年来提出的基于比特的超轻量级分组密码算法PICO抵抗积分密码分析的安全性进行评估。首先，研究了PICO密码算法的结构，并结合可分性质的思想构造其混合整数线性规划（MILP）模型；然后，根据设置的约束条件生成用于描述可分性质传播规则的线性不等式，并借助数学软件求解MILP问题，从目标函数值判断构建积分区分器成功与否；最终，实现对PICO算法积分区分器的自动化搜索。实验结果表明，搜索到了PICO算法目前为止最长的10轮积分区分器，但由于可利用的明文数太少，不利于密钥恢复。为了取得更好的攻击效果，选择搜索到的9轮积分区分器对PICO算法进行11轮密钥恢复攻击。通过该攻击能够恢复128比特轮子密钥，攻击的数据复杂度为2^63.46，时间复杂度为2⁷⁶次11轮算法加密，存储复杂度为2²⁰。     

对PICO算法基于可分性的积分攻击

对近年来提出的基于比特的超轻量级分组密码算法PICO抵抗积分密码分析的安全性进行评估。首先,研究了PICO密码算法的结构,并结合可分性质的思想构造其混合整数线性规划（MILP）模型;然后,根据设置的约束条件生成用于描述可分性质传播规则的线性不等式,并借助数学软件求解MILP问题,从目标函数值判断构建积分区分器成功与否;最终,实现对PICO算法积分区分器的自动化搜索。实验结果表明,搜索到了PICO算法目前为止最长的10轮积分区分器,但由于可利用的明文数太少,不利于密钥恢复。为了取得更好的攻击效果,选择搜索到的9轮积分区分器对PICO算法进行11轮密钥恢复攻击。通过该攻击能够恢复128比特轮子密钥,攻击的数据复杂度为2^63.46,时间复杂度为2⁷⁶次11轮算法加密,存储复杂度为2²⁰。     

SPECK型算法的积分分析和不可能差分分析

SPECK系列算法是2013年由美国国家安全局提出的一类重要的轻量分组密码算法.算法整体采用变形的Feistel结构,轮函数是由模加,循环移位和异或组成的ARX模块,其中模加运算为算法主要的非线性部件.目前对于SPECK系列算法的研究主要分为两个方面:一是针对原始SPECK算法安全性的分析,主要的攻击方法包括差分分析、线性分析、积分分析和不可能差分分析等;二是对采用不同移位参数的SPECK型算法的分析,主要包含对它们抗差分分析能力的评估.本文在此基础上研究了采用不同移位参数的SPECK型算法的积分性质和不可能差分性质.我们先利用混合整数线性规划方法,基于可分性搜索了SPECK型算法的积分区分器;接着利用中间相错思想,基于模加运算的差分性质,搜索了SPECK型算法的不可能差分特征.结合已有的差分分析的结论,我们给出了不同分组长度下具有更强抵抗多种攻击能力的好的移位参数.特别的,在减轮情形下,当分组长度为32比特时,我们发现采用移位参数(9,2)的SPECK型算法比原始算法具有更强的抵抗差分分析、积分分析和不可能差分分析的能力.     

基于神经区分器的KATAN48算法条件差分分析方法

针对KATAN48算法的安全性分析问题,提出了一种基于神经区分器的KATAN48算法条件差分分析方法。首先,研究了多输出差分神经区分器的基本原理,并将它应用于KATAN48算法,根据KATAN48算法的数据格式调整了深度残差神经网络的输入格式和超参数;其次,建立了KATAN48算法的混合整数线性规划(MILP)模型,并用该模型搜索了前加差分路径及相应的约束条件;最后,利用多输出差分神经区分器,至多给出了80轮KATAN48算法的实际密钥恢复攻击结果。实验结果表明,在单密钥下,KATAN48算法的实际攻击的轮数提高了10轮,可恢复的密钥比特数增加了22比特,数据复杂度和时间复杂度分别由2³⁴和2³⁴降至2^16.39和2^19.68。可见,相较于前人单密钥下的实际攻击,所提方法能够有效增加攻击轮数和可恢复的密钥比特数,同时降低攻击的计算复杂度。     

区分业务的混合网络资源优化方法

为了实现混合网络资源的最大利用,以IP/GMPLS over WDM网络为例,提出了一种区分业务的混合网络资源优化方法.该方法通过不给多跳低等级业务提供光路级保护,以及当承载LSP业务的工作光路故障无关的情况下保护光路共享波长资源的方式,有效降低了光路的建立数以及所需的波长数,在最大程度上提高了网络资源的利用率,降低了网络的整体开销.最后建立了整数线性规划模型,并通过该模型验证了方法的有效性.     

分组密码复杂线性层可分性传播的MILP刻画方法

混合整数线性规划(MILP)作为一种自动化搜索工具, 被广泛地应用于搜索分组密码的差分、线性、积分等密码性质. 提出一种基于动态选取策略构建MILP模型的新技术, 该技术在不同的条件下采用不同的约束不等式刻画密码性质的传播. 具体地, 从可分性出发根据输入可分性汉明重量的不同, 分别采用不同的方法构建线性层可分性传播的MILP模型. 最后, 将该技术应用于搜索uBlock和Saturnin算法的积分区分器. 实验结果表明: 对于uBlock128算法, 该技术可以搜索到比之前最优区分器多32个平衡比特的8轮积分区分器. 除此之外, 搜索到uBlock128和uBlock256算法比之前最优区分器更长一轮的9和10轮积分区分器. 对于Saturnin256算法, 同样搜索到比之前最优区分器更长一轮的9轮积分区分器.     

Control structure selection for energy integrated distillation column

This paper treats a case study on control structure selection for an almost binary distillation column. The column is energy integrated with a heat pump in order to transfer heat from the condenser to the reboiler. This integrated plant configuration renders the possible control structures somewhat different from what is usual for binary distillation columns. Further the heat pump enables disturbances to propagate faster through the system. The plant has six possible actuators of which three must be used to stabilize the system. Hereby three actuators are left for product purity control. An MILP screening method based on a linear state space model is used to determine economically optimal sets of controlled and manipulated variables. The generated sets of inputs and outputs are analysed with frequency dependent relative gain array (RGA), relative disturbance gain (RDG) and condition number (CN) to determine the best structure in terms disturbance rejection and setpoint tracking. The pairing and controller design are implemented and evaluated through nonlinear simulation. The suggested control structure is also qualitatively compared to a control structure applied experimentally.     

An enumeration algorithm for integer‐valued data envelopment analysis

Data envelopment analysis (DEA) models assume real‐valued inputs and outputs, but on many occasions, some inputs and/or outputs can only take integer values. In these cases, using DEA models can result in misleading efficiency assessments and inaccurate performance targets. In this paper, we propose an enumeration algorithm for computing efficiency scores and performance targets of decision‐making units with integer value inputs/outputs. In the presented algorithm, we do not use any of the mixed integer linear programming (MILP) models that are used in previous studies. We show that the result of our algorithm and that of the MILP model presented in this context is the same. We also generalize our algorithm for different types of returns to scale as well as for the hybrid setting with real‐valued data.     

一种求解整数规划与混合整数规划非线性罚函数方法

证明了任何一个变量有界的整数规划问题（IP）和混合整数规划问题（MIP）都可以转化为一个等价的非整数（或连续化）规划问题（NIP），并给出一个用非线性精确罚函数法来求解该等价NIP的方法，从而达到求解IP或MIP的目的，数值实验表明了算法的可行性。该方法可广泛用于各应用领域里IP和MIP的求解，特别是为非线性IP和MIP问题提供了一条通用 的求解途径，对解决许多实际优化问题具有重要意义。     

Coordinated road-network search route planning by a team of UAVs

This paper presents a road-network search route planning algorithm by which multiple autonomous vehicles are able to efficiently visit every road identified in the map in the context of the Chinese postman problem. Since the typical Chinese postman algorithm can be applied solely to a connected road-network in which ground vehicles are involved, it is modified to be used for a general type of road map including unconnected roads as well as the operational and physical constraints of unmanned aerial vehicles (UAVs). For this, a multi-choice multi-dimensional knapsack problem is formulated to find an optimal solution minimising flight time and then solved via mixed integer linear programming. To deal with the dynamic constraints of the UAVs, the Dubins theory is used for path generation. In particular, a circular–circular–circular type of the Dubins path is exploited based on a differential geometry to guarantee that the vehicles follow the road precisely in a densely distributed road environment. Moreover, to overcome the computational burden of the multi-choice multi-dimensional knapsack algorithm, a nearest insertion and auction-based approximation algorithm is newly introduced. The properties and performance of the proposed algorithm are evaluated via numerical simulations operating on a real village map and randomly generated maps with different parameters.     

The scheduling of maintenance. A resource-constraints mixed integer linear programming model

The scheduling of preventive maintenance is crucial in reliability and maintenance engineering. Hundreds of parts compose complex machines that require replacement and/or repairing. Maintenance involves the machine vendor (1), the machine user (2) and the service maintenance provider (3). The vendor and the maintenance service provider have to guarantee a high level of availability and productivity of the machines and maintain their down-time at a minimum even though they are installed worldwide and usually far from the vendor’s headquarters and/or the locations of the provider’s regional service offices. Moreover, many companies have great profits from maintenance and spare parts management.This study aims to illustrate an original mixed integer linear programming (MILP) model for the cost-based, reliability-based and resource-constraints scheduling of preventive maintenance actions. The model minimizes the total cost function made of spare parts contributions, the cost of the execution of the preventive actions and the cost of the additional repair activity in case of unplanned failure. The cost of the personnel of the producer and/or the maintenance service provider is also included. Finally, the paper presents a case study in a what-if environment demonstrating the effectiveness and the novelty of this study in real and complex applications.