检索结果-内蒙古大学图书馆

Implementation of a brute force attack on the A5/1 keystream generator in a GPU-based volunteer computing project 3

Implementation of a brute force attack on the A5/1 keystream...

3rd International Conference BOINC-Based High Performance Computing: Fundamental Research and Development, BOINC:FAST 2017

作者： Bulavintsev, Vadim Semenov, Alexander Zaikin, Oleg Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

We present an advanced brute force attack on the A5/1 keystream generator, that is still widely used in modern GSM networks. To greatly reduce the search space, we use a well-known idea, introduced by R. Anderson more than 20 years ago. The main contribution of the present paper is the implementation of Anderson's attack on a GPU platform in bit-slice technique. The preliminary estimates of the attack's speed showed that, with the use of GPUs processing power, the attack could be performed in the real time on a modern computer cluster or in a volunteer computing project. To verify our estimates with the use of the BOINC technology we launched a volunteer computing project and executed our variant of Anderson's attack within it. As a result, 10 A5/1 cryptanalysis problems were solved in 7 days in the project. The results presented in this work provide yet another proof of A5/1's cryptographic weakness that shows that this generator is totally unsuitable for transmission of any kind of sensitive data through modern GSM networks. Copyright © by the paper's authors. Copying permitted for private and academic purposes.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Approximation results for impulsive control systems with hysteresis 14

Approximation results for impulsive control systems with hys...

引用

14th International Conference "Stability and Oscillations of Nonlinear control systems" (Pyatnitskiy's Conference), STAB 2018

作者： Samsonyuk, O.N. Tolkachev, D.E. Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

In this paper, impulsive control systems described by measure-driven differential equations with rate independent hysteresis are considered. Approximation results for impulsive processes are presented. © 2018 IEEE.

ISBN: (纸本)9781538645567

关键词： Hysteresis

来源：评论

学校读者我要写书评

暂无评论

A Local Search Scheme for the Inequality-Constrained Optimal control Problem 20th

A Local Search Scheme for the Inequality-Constrained Optimal...

引用

20th International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2021

作者： Strekalovsky, A.S. Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (纸本)9783030778750

This paper addresses the nonconvex optimal control (OC) problem with the cost functional and inequality constraint given by the functionals of Bolza. All the functions in the statement of the problem are state-DC, i.e. presented by a difference of the state-convex functions. Meanwhile, the control system is state-linear. Further, with the help of the Exact Penalization theory we propose the state-DC form of the penalized cost functional and, using the linearization with respect to the basic nonconvexity of the penalized problem, we study the linearized OC problem. On this basis, we develop a general scheme of the special Local Search Method with a varying penalty parameter. Finally, we address the convergence of the proposed scheme. © 2021, Springer Nature Switzerland AG.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator 20th

An Improved SAT-Based Guess-and-Determine Attack on the Alte...

引用

20th International Conference on Information Security, ISC 2017

作者： Zaikin, Oleg Kochemazov, Stepan Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (纸本)9783319696584

In this paper, we propose an algorithm for constructing guess-and-determine attacks on keystream generators and apply it to the cryptanalysis of the alternating step generator (ASG) and two its modifications (MASG and MASG0). In a guess-and-determine attack, we first "guess" some part of an initial state and then apply some procedure to determine, if the guess was correct and we can use the guessed information to solve the problem, thus performing an exhaustive search over all possible assignments of bits forming a chosen part of an initial state. We propose to use in the "determine" part the algorithms for solving Boolean satisfiability problem (SAT). It allows us to consider sets of bits with nontrivial structure. For each such set it is possible to estimate the runtime of a corresponding guess-and-determine attack via the Monte-Carlo method, so we can search for a set of bits yielding the best attack via a black-box optimization algorithm augmented with several SAT-specific features. We constructed and implemented such attacks on ASG, MASG, and MASG0 to prove that the constructed runtime estimations are reliable. We show, that the constructed attacks are better than the trivial ones, which imply exhaustive search over all possible states of the control register, and present the results of experiments on cryptanalysis of ASG and MASG/MASG0 with total registers length of 72 and 96, which have not been previously published in the literature. © 2017, Springer International Publishing AG.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

On a Solving Bilevel D.C.-Convex Optimization Problems 19th

On a Solving Bilevel D.C.-Convex Optimization Problems

引用

19th International Conference on Mathematical Optimization theory and Operations Research,MOTOR 2020

作者： Orlov, Andrei V. Matrosov Institute for System Dynamics and Control Theory of SB of RAS Irkutsk Russia

ISBN: (纸本)9783030586560

This work addresses the optimistic statement of a bilevel optimization problem with a general d.c. optimization problem at the upper level and a convex optimization problem at the lower level. First, we use the reduction of the bilevel problem to a nonconvex mathematical optimization problem using the well-known Karush-Kuhn-Tucker approach. Then we employ the novel Global Search theory and Exact Penalty theory to solve the resulting nonconvex optimization problem. Following this theory, the special method of local search in this problem is constructed. This method takes into account the structure of the problem in question. © 2020, Springer Nature Switzerland AG.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Classification in Binary Feature Space Using Logical Dynamic Models 44

Classification in Binary Feature Space Using Logical Dynamic...

引用

44th International Convention on Information, Communication and Electronic Technology, MIPRO 2021

作者： Oparin, G.A. Bogdanova, V.G. Pashinin, A.A. Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (纸本)9789532331011

The article proposes a method based on the use of logical dynamic systems in the classification problem for Boolean vectors (binary feature vectors). This method has practical application in various fields of science and industry, in particular, socionics, geology, mechanical engineering, and others. Binary synchronous autonomous linear and nonlinear dynamic models with an unknown characteristic matrix are considered. Matrix elements are chosen the way that these binary feature vectors are equilibrium states of the binary dynamic model. The areas of attraction of equilibrium states act as classes. One reference vector corresponds to each class. The classification process consists of constructing trajectories of a logical-dynamic system with a given initial state. It aims to verify the reachability of one of the equilibrium states. A meaningful example of the proposed method is considered. © 2021 Croatian Society MIPRO.

关键词： Dynamic models

来源：评论

学校读者我要写书评

暂无评论

Service-oriented Application for Solving Parametric Synthesis Problem of a Boolean Network with Given Dynamic Properties 44

Service-oriented Application for Solving Parametric Synthesi...

引用

44th International Convention on Information, Communication and Electronic Technology, MIPRO 2021

作者： Oparin, G.A. Bogdanova, V.G. Pashinin, A.A. Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (纸本)9789532331011

A constructive logical method for the synthesis of the characteristic matrix of a linear binary dynamical system with a given set of one-point attractors and one-step dynamics of reaching this set from any state is proposed. The problem conditions are written as a quantified Boolean formula with subsequent verification of its truth using the QSAT solver. This solver provide the values of the elements of the required matrix as a certificate. The proposed method implementation is performed using automation tools for constructing and executing composite services in an applied microservices package for solving problems of qualitative research of binary dynamic systems. These tools provide cloud services for getting a quantified Boolean formula in QDIMACS format, verifying its truth, getting a constructive solution to the considered problem, and supporting synchronization of cloud and local data in a hybrid cloud infrastructure using Dew Computing. © 2021 Croatian Society MIPRO.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristics for a Partial Set Covering Problem with Mutually Exclusive Pairs of Facilities 1

引用

7th International Conference on Optimization, Simulation and control, COSC 2022

作者： Belykh, Aleksander Gruzdeva, Tatyana Ushakov, Anton Vasilyev, Igor Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (数字)9783031412295

ISBN: (纸本)9783031412288

Set cover problems are among the most popular and well-studied models in facility location. In this paper, we address an extension of the set covering and partial set covering problems. We suppose that a set of customers to be served is divided into two non-overlapped subsets: "mandatory" customers who must always be covered and "optional" customers who do not require obligatory coverage. To avoid a trivial solution that covers only customers from H, we suppose that the number of covered optional customers must be at least larger than a pre-defined threshold In the real world, local laws may prohibit location of a large number of facilities in some places to reduce harm to people and/or nature. To reflect that fact our problem involves pairs of facilities that are mutually exclusive, hence if a facility from such a pair is located, another one is prohibited. We formulate this problem as an integer linear program and develop and implement several fast heuristic approaches capable of finding high-quality solutions of large-scale problem instances arisen in real-life settings. In particular, we develop a hybrid heuristic involving a greedy algorithm and local search embedded into a variable neighborhood framework. We test our algorithms in a series of intensive computational experiments on both real-life problems and synthetically generated instances. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

dynamics of Bipartite Logical Networks 47

Dynamics of Bipartite Logical Networks

引用

47th ICT and Electronics Convention, MIPRO 2024

作者： Oparin, G.A. Bogdanova, V.G. Pashinin, A.A. Matrosov Institute For System Dynamics And Control Theory Of Sb Ras Irkutsk Russia

ISBN: (纸本)9798350382495

Based on the Boolean constraints method several problems of qualitative analysis of bipartite logical networks are solved. The dynamics of the trajectories behavior of these networks is studied over a finite time interval. A method is proposed for splitting a bipartite trajectory into two independent trajectories based on deterministic block-sequential updating of the state vectors of each part. Conditions for the existence, isolation and attraction of cyclic trajectories of a given length are obtained as Boolean constraints. The solvability of such equations reduces to the well-known Boolean satisfiability problem, effectual algorithms for solving which provide dynamic analysis for systems with high dimensionality of the state vector over large discrete time intervals. The program modules implementation for building Boolean constraints and checking their feasibility in the form of microservices ensures their reuse, simplification of deployment, updating, and high scalability in the cloud environment. Multi-agent computation management in an applied microservices package provides the non-procedural problem formulation on a distributed model of the subject area, forms and executes a scheme for solving it, and automates the additional resources provision. The practical significance of the obtained results consists in providing the opportunity for a more detailed study of dynamics of the molecular features of gene regulation networks. © 2024 IEEE.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Unification of the predicate line in the logic-syntactic recognition of raster images

引用

Pattern Recognition and Image Analysis 2011年第2期21卷 242-246页

作者： Fedorov, R.K. Shigarov, A.O. Institute of System Dynamics and Control Theory Russian Academy of Sciences ul. Lermontova 134 POB 292 Irkutsk 664033 Russia

A logic-syntactic method of object recognition on images is proposed that is based on logical inference with use of the structural description of objects. The search for boundaries of objects on the image is performed as unification of the built-in predicate line with account of the set of constraints specified by the description. © 2011 Pleiades Publishing, Ltd.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：