arXiv subjects

Alexander Semenov

Publications and source records attributed to Alexander Semenov.

35 records · Page 2Linked to original sources

arXiv2020

Transport and thermodynamics in quantum junctions: A scattering approach

We present a scattering approach for the study of the transport and thermodynamics of quantum systems strongly coupled to their thermal environment(s). This formalism recovers the standard non-equilibrium Green's function expressions for quantum transport and reproduces recently obtained results for the quantum thermodynamic of slowly driven systems. Using this approach, new results have been obtained. First, we derived of a general explicit expression for non-equilibrium steady state density matrix of a system compromised of multiple infinite baths coupled through a general interaction. Then, we obtained a general expression for the dissipated power for the driven non-interacting resonant level to first order in the driving speeds, where both the dot energy level and its couplings are changing, without invoking the wide band approximation. In addition, we also showed that the symmetric splitting of system bath interaction, employed for the case of a system coupled to one bath to determine the effective system Hamiltonian [Phys. Rev. B 93, 115318 (2016)] is valid for the multiple baths case as well. Finally, we demonstrated an equivalence of our method to the Landauer-Buttiker formalism and its extension to slowly driven systems developed by von Oppen and co-workers [Phys. Rev. Lett. 120, 107701 (2018)]. To demonstrate the use of this formalism we analyze the operation a device in which the dot is driven cyclically between two leads under strong coupling conditions. We also generalize the previously obtained expression for entropy production in such driven processes to the many-bath case.

cond-mat.stat-mech↗

arXiv2020

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

In the present paper, we propose a technology for translating algorithmic descriptions of discrete functions to SAT. The proposed technology is aimed at applications in algebraic cryptanalysis. We describe how cryptanalysis problems are reduced to SAT in such a way that it should be perceived as natural by the cryptographic community. In~the theoretical part of the paper we justify the main principles of general reduction to SAT for discrete functions from a class containing the majority of functions employed in cryptography. Then, we describe the Transalg software tool developed based on these principles with SAT-based cryptanalysis specifics in mind. We demonstrate the results of applications of Transalg to construction of a number of attacks on various cryptographic functions. Some of the corresponding attacks are state of the art. We compare the functional capabilities of the proposed tool with that of other domain-specific software tools which can be used to reduce cryptanalysis problems to SAT, and also with the CBMC system widely employed in symbolic verification. The paper also presents vast experimental data, obtained using the SAT solvers that took first places at the SAT competitions in the recent several years.

cs.LO↗

arXiv2019

Electron transfer in confined electromagnetic fields

The interaction between molecular (atomic) electron(s) and the vacuum field of a reflective cavity generates a significant interest thanks to the rapid developments in nanophotonics. Such interaction which lies within the realm of cavity quantum electrodynamic can substantially affect transport properties of molecular systems. In this work we consider non-adiabatic electron transfer process in the presence of a cavity mode. We present a generalized framework for the interaction between a charged molecular system and a quantized electromagnetic field of a cavity and apply it to the problem of electron transfer between a donor and an acceptor placed in a confined vacuum electromagnetic field. The effective system Hamiltonian corresponds to a unified Rabi and spin-boson model which includes a self-dipole energy term. Two limiting cases are considered: one where the electron is assumed much faster than the cavity mode and another in which the electron tunneling time is significantly larger than the mode period. In both cases a significant rate enhancement can be produced by coupling to the cavity mode in the Marcus inverted region. The results of this work offer new possibilities for controlling electron transfer processes using visible and infrared plasmonics

physics.chem-ph↗

arXiv2019

An Integer Programming Formulation of the Key Management Problem in Wireless Sensor Networks

With the advent of modern communications systems, much attention has been put on developing methods for securely transferring information between constituents of wireless sensor networks. To this effect, we introduce a mathematical programming formulation for the key management problem, which broadly serves as a mechanism for encrypting communications. In particular, an integer programming model of the q-Composite scheme is proposed and utilized to distribute keys among nodes of a network whose topology is known. Numerical experiments demonstrating the effectiveness of the proposed model are conducted using using a well-known optimization solver package. An illustrative example depicting an optimal encryption for a small-scale network is also presented.

cs.CR↗

arXiv2018

On Cryptographic Attacks Using Backdoors for SAT

Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number of practical applications of SAT can only be tackled efficiently by identifying and exploiting a subset of formula's variables called backdoor set (or simply backdoors). This paper proposes a new class of backdoor sets for SAT used in the context of cryptographic attacks, namely guess-and-determine attacks. The idea is to identify the best set of backdoor variables subject to a statistically estimated hardness of the guess-and-determine attack using a SAT solver. Experimental results on weakened variants of the renowned encryption algorithms exhibit advantage of the proposed approach compared to the state of the art in terms of the estimated hardness of the resulting guess-and-determine attacks.

cs.AI↗

arXiv2018

Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4

In this paper we construct preimage attack on the truncated variant of the MD4 hash function. Specifically, we study the MD4-39 function defined by the first 39 steps of the MD4 algorithm. We suggest a new attack on MD4-39, which develops the ideas proposed by H. Dobbertin in 1998. Namely, the special relaxation constraints are introduced in order to simplify the equations corresponding to the problem of finding a preimage for an arbitrary MD4-39 hash value. The equations supplemented with the relaxation constraints are then reduced to the Boolean Satisfiability Problem (SAT) and solved using the state-of-the-art SAT solvers. We show that the effectiveness of a set of relaxation constraints can be evaluated using the black-box function of a special kind. Thus, we suggest automatic method of relaxation constraints generation by applying the black-box optimization to this function. The proposed method made it possible to find new relaxation constraints that contribute to a SAT-based preimage attack on MD4-39 which significantly outperforms the competition.

cs.AI↗

arXiv2018

Topological engineering of interfacial optical Tamm states for highly-sensitive near-singular-phase optical detection

We developed planar multilayered photonic-plasmonic structures, which support topologically protected optical states on the interface between metal and dielectric materials, known as optical Tamm states. Coupling of incident light to the Tamm states can result in perfect absorption within one of several narrow frequency bands, which is accompanied by a singular behavior of the phase of electromagnetic field. In the case of near-perfect absorptance, very fast local variation of the phase can still be engineered. In this work, we theoretically and experimentally demonstrate how these drastic phase changes can improve sensitivity of optical sensors. A planar Tamm absorber was fabricated and used to demonstrate remote near-singular-phase temperature sensing with an over an order of magnitude improvement in sensor sensitivity and over two orders of magnitude improvement in the figure of merit over the standard approach of measuring shifts of resonant features in the reflectance spectra of the same absorber. Our experimentally demonstrated phase-to-amplitude detection sensitivity improvement nearly doubles that of state-of-the-art nano-patterned plasmonic singular-phase detectors, with further improvements possible via more precise fabrication. Tamm perfect absorbers form the basis for robust planar sensing platforms with tunable spectral characteristics, which do not rely on low-throughput nano-patterning techniques.

physics.optics↗

arXiv2017

Multimodal Clustering for Community Detection

Multimodal clustering is an unsupervised technique for mining interesting patterns in $n$-adic binary relations or $n$-mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n$-sets for $n$-mode case, etc. Object-attribute biclustering (OA-biclustering) for mining large binary datatables (formal contexts or 2-mode networks) arose by the end of the last decade due to intractability of computation problems related to formal concepts; this type of patterns was proposed as a meaningful and scalable approximation of formal concepts. In this paper, our aim is to present recent advance in OA-biclustering and its extensions to mining multi-mode communities in SNA setting. We also discuss connection between clustering coefficients known in SNA community for 1-mode and 2-mode networks and OA-bicluster density, the main quality measure of an OA-bicluster. Our experiments with 2-, 3-, and 4-mode large real-world networks show that this type of patterns is suitable for community detection in multi-mode cases within reasonable time even though the number of corresponding $n$-cliques is still unknown due to computation difficulties. An interpretation of OA-biclusters for 1-mode networks is provided as well.

cs.SI↗

arXiv2016

A Distributed Parallel Algorithm for Minimum Spanning Tree Problem

In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for one specific message type compared to the original GHS (Gallager, Humblet, Spira) algorithm. Our algorithm adopts hashing and message compression optimization techniques as well. To the best of our knowledge, this is the first parallel implementation of the GHS algorithm that linearly scales to more than 32 nodes (256 cores) of Infiniband cluster.

cs.DC↗

arXiv2016

Potential of a Superconducting Photon Counter for Heterodyne Detection at Telecommunication Wavelength

Here, we report on successful operation of a NbN thin film superconducting nanowire single-photon detector (SNSPD) in a coherent mode (as a mixer) at the telecommunication wavelength of 1550 nm. Providing the Local Oscillator power of the order of a few picowatts, we were practically able to reach the quantum noise limited sensitivity. The intermediate frequency gain bandwidth was limited by the spectral band of single-photon response pulse of the detector, which is proportional to the detector size. We observed gain bandwidth of 65 MHz and 140 MHz for 7x7 um^2 and 3x3 um^2 devices respectively. Tiny amount of the required Local Oscillator power and wide gain and noise bandwidths along with the needless of any Low Noise Amplification opens possibility for a photon counting heterodyne-born megapixel array development.

physics.ins-det↗

arXiv2016

Encoding Cryptographic Functions to SAT Using Transalg System

In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers. We implemented this technology in the form of the software system called Transalg, and used it to construct SAT encodings for a number of cryptanalysis problems. By applying SAT solvers to these encodings we managed to invert several cryptographic functions. In particular, we used the SAT encodings produced by Transalg to construct the family of two-block MD5 collisions in which the first 10 bytes are zeros. Also we used Transalg encoding for the widely known A5/1 keystream generator to solve several dozen of its cryptanalysis instances in a distributed computing environment. In the paper we compare in detail the functionality of Transalg with that of similar software systems.

cs.AI↗

arXiv2015

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT

In this paper we present the Transalg system, designed to produce SAT encodings for discrete functions, written as programs in a specific language. Translation of such programs to SAT is based on propositional encoding methods for formal computing models and on the concept of symbolic execution. We used the Transalg system to make SAT encodings for a number of cryptographic functions.

cs.AI↗

arXiv2015

Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem

In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary partitioning is determined by the total time of solving of all SAT instances from it. We suggest the approach, based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning. With each partitioning we associate a point in the special finite search space. The estimation of effectiveness of the particular partitioning is the value of predictive function in the corresponding point of this space. The problem of search for an effective partitioning can be formulated as a problem of optimization of the predictive function. We use metaheuristic algorithms (simulated annealing and tabu search) to move from point to point in the search space. In our computational experiments we found partitionings for SAT instances encoding problems of inversion of some cryptographic functions. Several of these SAT instances with realistic predicted solving time were successfully solved on a computing cluster and in the volunteer computing project SAT@home. The solving time agrees well with estimations obtained by the proposed method.

cs.AI↗

arXiv2014

Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks

In this paper we describe the volunteer computing project SAT@home, developed and maintained by us. This project is aimed at solving hard instances of the Boolean satisfiability problem (SAT). We believe that this project can be a useful tool for computational study of inversion problems of some cryptographic functions. In particular we describe a series of experiments performed in SAT@home on the cryptanalysis of the widely known keystream generator A5/1. In all experiments we analyzed one known burst (114 bits) of keystream produced by A5/1. Before the cryptanalysis itself there is a stage on which the partitioning of the original problem to a family of subproblems is carried out. Each of subproblems should be easy enough so that it could be solved in relatively small amount of time by volunteer's PC. We construct such partitioning using the special technique based on the Monte Carlo method and discrete optimization algorithms for special predictive functions. Besides this in the paper we describe the technique for reducing inversion problems of cryptographic functions to SAT.

cs.DC↗

arXiv2014

Using synchronous Boolean networks to model several phenomena of collective behavior

In this paper, we propose an approach for modeling and analysis of a number of phenomena of collective behavior. By collectives we mean multi-agent systems that transition from one state to another at discrete moments of time. The behavior of a member of a collective (agent) is called conforming if the opinion of this agent at current time moment conforms to the opinion of some other agents at the previous time moment. We presume that at each moment of time every agent makes a decision by choosing from the set {0,1} (where 1-decision corresponds to action and 0-decision corresponds to inaction). In our approach we model collective behavior with synchronous Boolean networks. We presume that in a network there can be agents that act at every moment of time. Such agents are called instigators. Also there can be agents that never act. Such agents are called loyalists. Agents that are neither instigators nor loyalists are called simple agents. We study two combinatorial problems. The first problem is to find a disposition of instigators that in several time moments transforms a network from a state where a majority of simple agents are inactive to a state with a majority of active agents. The second problem is to find a disposition of loyalists that returns the network to a state with a majority of inactive agents. Similar problems are studied for networks in which simple agents demonstrate the contrary to conforming behavior that we call anticonforming. We obtained several theoretical results regarding the behavior of collectives of agents with conforming or anticonforming behavior. In computational experiments we solved the described problems for randomly generated networks with several hundred vertices. We reduced corresponding combinatorial problems to the Boolean satisfiability problem (SAT) and used modern SAT solvers to solve the instances obtained.

cs.SI↗

arXiv2013

On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project

This paper proposes a method to estimate the total time required to solve SAT in distributed environments via partitioning approach. It is based on the observation that for some simple forms of problem partitioning one can use the Monte Carlo approach to estimate the time required to solve an original problem. The method proposed is based on an algorithm for searching for partitioning with an optimal solving time estimation. We applied this method to estimate the time required to perform logical cryptanalysis of the widely known stream ciphers A5/1 and Bivium. The paper also describes a volunteer computing project SAT@home aimed at solving hard combinatorial problems reduced to SAT. In this project during several months there were solved 10 problems of logical cryptanalysis of the A5/1 cipher thatcould not be solved using known rainbow tables.

cs.AI↗

arXiv2011

Parallel algorithms for SAT in application to inversion problems of some discrete functions

In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model checking, hardware verification, cryptanalysis, computer biology and other domains. Quite often it is necessary to invert these functions, i.e. to find an unknown preimage if an image and algorithm of function computation are given. In general case this problem is computationally intractable. However, many of it's special cases are very important in practical applications. Thus development of algorithms that are applicable to these special cases is of importance. The practical applicability of such algorithms can be validated by their ability to solve the problems that are considered to be computationally hard (for example cryptanalysis problems). In this article we propose the technology of solving the inversion problem for polynomially computable discrete functions. This technology was implemented in distributed computing environments (parallel clusters and Grid-systems). It is based on reducing the inversion problem for the considered function to some SAT problem. We describe a general approach to coarse-grained parallelization for obtained SAT problems. Efficiency of each parallelization scheme is determined by the means of a special predictive function. The proposed technology was validated by successful solving of cryptanalysis problems for some keystream generators. The main practical result of this work is a complete cryptanalysis of keystream generator A5/1 which was performed in a Grid system specially built for this task.

cs.DC↗