检索结果-南通市图书馆

在线全文

学校读者我要写书评

暂无评论

基于milp的MGFN全轮差分分析及改进

计算机应用研究 2024年第3期41卷 911-915,922页

作者：李艳俊毕鑫杰项勇林怡平中国电子科技集团公司第十五研究所信息产业信息安全测评中心北京100083 北京电子科技学院密码科学与技术系北京100070 北京电子科技学院网络空间安全系北京100070

研究了轻量级分组密码MGFN算法的抗差分分析能力并提出了改进方法。首先,基于milp工具对MGFN算法建模,搜索迭代差分并构造了全轮差分路径,整体差分概率为2-40,远远大于随机置换的差分概率。然后,给出S盒的差分分支数概念并将其作为衡量... 详细信息

研究了轻量级分组密码MGFN算法的抗差分分析能力并提出了改进方法。首先,基于milp工具对MGFN算法建模,搜索迭代差分并构造了全轮差分路径,整体差分概率为2-40,远远大于随机置换的差分概率。然后,给出S盒的差分分支数概念并将其作为衡量差分安全性的指标,以新S盒替代原MGFN算法的S盒,并修改了密钥扩展算法,提出新的MGFN-P算法。最后,通过差分路径搜索和分析比较,说明了MGFN-P算法比原MGFN算法更安全、高效。

关键词： MGFN 轻量级分组密码 milp 差分分析分支数

SAILFISH-I、ASD算法基于milp的积分分析

在线全文

学校读者我要写书评

暂无评论

北京电子科技学院学报 2024年第1期32卷 60-71页

作者：吴铜申龙北京电子科技学院北京市100070

SAILFISH-I、ASD算法是近些年提出的基于Feistel和SPN结构的轻量级分组密码。根据密码的结构特点,分别构造了基于比特的混合整数线性规划(milp)可分性质模型,并使用求解器Gurobi对milp模型求解。本文首次得到SAILFISH-I算法的8、9、10... 详细信息

SAILFISH-I、ASD算法是近些年提出的基于Feistel和SPN结构的轻量级分组密码。根据密码的结构特点,分别构造了基于比特的混合整数线性规划(milp)可分性质模型,并使用求解器Gurobi对milp模型求解。本文首次得到SAILFISH-I算法的8、9、10轮积分区分器,ASD算法的7、8、9轮积分区分器。在SAILFISH-I的9轮积分区分器的基础上,向后扩展3轮,进行12轮积分攻击,攻击的数据复杂度约为2^(59.58)个选择明文,时间复杂度约为2^(109.99)次12轮加密,存储复杂度约为2^(57)个储存单元。在ASD的8轮积分区分器的基础上向后扩展2轮,进行10轮积分攻击,攻击的数据复杂度约为2^(57.39)个选择明文,时间复杂度约为2^(70.07)次10轮加密,存储复杂度约为2^(20)个储存单元。

关键词： SAILFISH-I ASD 可分性质 milp 积分攻击

Energy-Efficient UAVs Coverage Path Planning Approach

同方期刊数据库博看期刊评论

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2023年第9期136卷 3239-3263页

作者： Gamil Ahmed Tarek Sheltami Ashraf Mahmoud Ansar Yasar Computer Engineering Department Interdisciplinary Research Center of Smart Mobility and LogisticsKing Fahd University of Petroleum and MineralsDhahran31261Saudi Arabia Transportation Research Institute(IMOB) Hasselt UniversityHasselt3500Belgium

Unmanned aerial vehicles(UAVs),commonly known as drones,have drawn significant consideration thanks to their agility,mobility,and flexibility features.They play a crucial role in modern reconnaissance,inspection,intelligence,and surveillance missions.Coverage path planning(CPP)which is one of the crucial aspects that determines an intelligent system’s quality seeks an optimal trajectory to fully cover the region of interest(ROI).However,the flight time of the UAV is limited due to a battery limitation and may not cover the whole region,especially in large region.Therefore,energy consumption is one of the most challenging issues that need to be optimized.In this paper,we propose an energy-efficient coverage path planning algorithm to solve the CPP problem.The objective is to generate a collision-free coverage path that minimizes the overall energy consumption and guarantees covering the whole region.To do so,the flight path is optimized and the number of turns is reduced to minimize the energy consumption.The proposed approach first decomposes the ROI into a set of cells depending on a UAV camera footprint.Then,the coverage path planning problem is formulated,where the exact solution is determined using the CPLEX solver.For small-scale problems,the CPLEX shows a better solution in a reasonable time.However,the CPLEX solver fails to generate the solution within a reasonable time for large-scale problems.Thus,to solve the model for large-scale problems,simulated annealing forCPP is developed.The results show that heuristic approaches yield a better solution for large-scale problems within amuch shorter execution time than the CPLEX solver.Finally,we compare the simulated annealing against the greedy algorithm.The results show that simulated annealing outperforms the greedy algorithm in generating better solution quality.

关键词： Coverage path planning milp CPLEX solver energy model optimization region of interest area of interest

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第2期65卷 246-247页

作者： Juan DU Wei WANG Muzhou LI Meiqin WANG Key Laboratory of Cryptologic Technology and Information Security Ministry of EducationShandong University

Dear editor,QARMA[1]is a family of hardware-oriented lightweight tweakable block ciphers designed by Avanzi.It contains two versions,which support block sizes of 64 and 128 bits,denoted by QARMA-64 and QARMA-128,respe... 详细信息

关键词： Tweakable Block Cipher QARMA Impossible Differential Related Tweakey milp

milp synthesis of separation processes for waste oil-in-water emulsions treatment

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Chemical Science and Engineering 2016年第1期10卷 120-130页

作者： Zorka N. Pintaric Gorazd P. Skof Zdravko Kravanja Faculty of Chemistry and Chemical Engineering University of Maribor Smetanova ulica 17 SI-2000 Maribor Slovenia EKOLID Ekologko svetovanje Raziskave in razvoj Ru~ka cesta 55 SI-2000 Maribor Slovenia

This paper presents a novel synthesis method for designing integrated processes for oil-in-water （O/W） emulsions treatment. General superstructure involving alternative separation technologies is developed and modelled as a mixed integer linear programming （milp） model for maximum annual profit. Separation processes in the superstructure are divided into three main sections of which the pretreatment and final treatment are limited to the selection of one altemative （or bypass） only, while within the intermediate section various combinations of different technologies in series can be selected. Integrated processes composed of selected separation techniques for given ranges of input chemical oxygen demand （COD） can be proposed by applying parametric analyses within the superstructure approach. This approach has been applied to an existing industrial case study for deriving optimal combinations of technologies for treating diverse oil-in- water emulsions within the range of input COD values between 1000 mg-L-1 and 145000 mgL t. The optimal solution represents a flexible and profitable process for reducing the COD values below maximal allowable limits for discharging effluent into surface water.

关键词： oil-in-water emulsion chemical oxygen demand superstructure process synthesis milp

milp formulations for highway petrol station replenishment in initiative distribution mode

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Petroleum Science 2021年第3期18卷 994-1010页

作者： Xin-Tong Wei Qi Liao Hao-Ran Zhang Yong-Tu Liang Bo-Hong Wang Ning Xu Meng Yuan Beijing Key Laboratory of Urban Oil and Gas Distribution Technology Beijing 102249China Center for Spatial Information Science The University of Tokyo5-1-5 KashiwanohaKashiwa-shiChiba 277-8568Japan

To investigate highway petrol station replenishment in initiative distribution mode,this paper develops a mixed-integer linear programming(milp)model with minimal operational costs that includes loading costs,unloading costs,transport costs and the costs caused by unpunctual distribution.Based on discrete representation,the working day is divided into equal time intervals,and the truck distribution process is decomposed into a pair of tasks including driving,standby,rest,loading and unloading.Each truck must execute one task during a single interval,and the currently executing task is closely related to the preceding and subsequent tasks.By accounting for predictive time-varying sales at petrol stations,real-time road congestion and a series of operational constraints,the proposed model produces the optimal truck dispatch,namely,a detailed task assignment for all trucks during each time interval.The model is tested on a real-world case of a replenishment system comprising eight highway petrol stations,one depot,one garage and eight trucks to demonstrate its applicability and accuracy.

关键词： milp Initiative distribution Petrol station Replenishment Discrete representation

milp Model for Plant-Wide Optimal By-Product Gas Scheduling in Iron and Steel Industry

在线全文

学校读者我要写书评

暂无评论

Journal of Iron and Steel Research(International) 2010年第7期17卷 34-37页

作者： KONG Hai-ning QI Er-shi HE Shu-guang, LI Gang Management School Tianjin University Tianjin 300072 China

The scheduling of by-product gases in by-product gas system,cogeneration system and production system is studied.All gas-consuming users are divided into three kinds according to their different characters and then a distribution model is built.A dynamic mixed integer linear programming（milp）model for multiperiod optimization of by-product gas is performed to optimize by-product gas distribution to achieve total cost reduction.Case study shows that 6.2% operation cost is reduced by using the proposed model.

关键词： iron and steel industry milp by-product gas distribution scheduling

A Novel milp Model for N-vehicle Exploration Problem

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2021年第2期9卷 359-373页

作者： Guo-Jun Zhang Jin-Chuan Cui Academy of mathematics and Systems Science Chinese Academy of SciencesBeijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China

The N-vehicle exploration problem(NVEP)is a nonlinear discrete scheduling problem,and the complexity status remains open.To our knowledge,there is no literature until now employing mixed integer linear programming(milp)technology to solve this problem except for Wang(J Oper Res Soc China 3(4):489–498,2015).However,they did not give numerical experiments since their model existed strictly inequalities and the number of constraints was up to O(n3),which was inefficient to solve practical problems.This paper establishes a more concise milp model,where the number of constraints is just O(n2).Therefore,the existing efficient milp algorithms can be used to solve NVEP.Secondly,we provide some properties of N-vehicle problem and give three methods for cutting plane construction,which can increase the solving speed significantly.Finally,a numerical experiment is provided to verify the effectiveness and robustness for different instances and scales of acceleration techniques.

关键词： N-vehicle exploration problem(NVEP) milp Cutting plane

Automatic search method for multiple differentials and its application on MANTIS

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第3期62卷 145-159页

作者： Shiyao CHEN Ru LIU Tingting CUI Meiqin WANG Key Laboratory of Cryptologic Technology and Information Security Ministry of EducationShandong University

Multiple differential cryptanalysis is one of the extensions of classic differential cryptanalysis. In this paper, we present a generic automatic search method for clustering multiple differentials on a target block cipher. Our search method has two steps. Firstly, the sets of input and output differences will be determined.With these sets, we get different multiple differentials. Then for each one of these multiple differentials, we enumerate and record all satisfied differential trails, which leads to a more accurate evaluation of the multiple differentials distinguisher. Among these different multiple differentials distinguishers, we can choose the best one for key recovery attack. We demonstrate our search method by applying it on the part of differentials of the block cipher MANTIS. As a result, we find a new 10-round multiple differentials distinguisher with probability 2;and an 11-round multiple differentials distinguisher with probability 2;, which is the longest distinguisher for MANTIS so far as we know. This new 10-round distinguisher can lead to a better signal-to-noise ratio, so we derive an improved key recovery attack on MANTIS-6 with the complexity of about 2;chosen-plaintext queries, 2;encryptions and data-time product 2;, which is better than the previous best one with data-time product 2;. Aiming at exploring the gap between the performance of multiple differential attack and the security margin on MANTIS, we also use the 11-round distinguisher to derive a key recovery attack on MANTIS-7 with the complexity of about 2;chosen-plaintext queries,2;encryptions and data-time product 2;. It does not threat the security of full version MANTIS（MANTIS-7） since the security bound of data-time product claimed by the designers is 2;.

关键词： multiple di?erential cryptanalysis structure attack automatic search MANTIS milp