The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider the fundamental derandomization problem of deterministically finding a satisfying assignment to a CNF formula that has many satisfying assignments. We give a deterministic algorithm which, given an n-variable \poly(n)-clause CNF formula F that has at least ≥ 2^n satisfying assignments, runs in time \[ n^{\tilde{O}(\log\log n)^2} \] for ≥ \ge 1/\polylog(n) and outputs...
Over the years, system calls (syscalls) have become an increasingly popular data source for host intrusion detection systems (HIDS). This is partly due to their strong security semantic implications. As syscalls conform to a program's control-flow graph, a deviation in a syscall sequence may imply a deviation in a program's control-flow graph. This is useful for detecting the control-flow hijacking...
Indian costal region has low ocean wave flux density but it has a vast seashore area due to which the overall potential of ocean wave energy is extremely high. In addition, harnessing of ocean wave energy has minimum environmental impact. Till date only one project based on oscillating water column has been established in India. The project covers huge constructional area with high complexity. Therefore...
A weight-t halfspace} is a Boolean function f(x)=\sign(w_1 x_1 + … + w_n x_n - θ) where each w_i is an integer in \{-t,\dots,t\}. We give an explicit pseudorandom generator that δ-fools any intersection of k weight-t halfspaces with seed length \poly(\log n, \log k,t,1/δ). In particular, our result gives an explicit PRG that fools any intersection of any...
The gap-ETH assumption (Dinur 2016; Manurangsi and Raghavendra 2016) asserts that it is exponentially-hard to distinguish between a satisfiable 3-CNF formula and a 3-CNF formula which is at most 0.99-satisfiable. We show that this assumption follows from the exponential hardness of finding a satisfying assignment for smooth 3-CNFs. Here smoothness means that the number of satisfying assignments is...
For practical applications in forward error correction, the importance of a systematic codeword cannot be overemphasized. Thus, this paper proposes the construction of a systematic quasi-cyclic (QC) LDPC code. This systematic structure is achieved by a row reduction technique different from the conventional Gaussian elimination method. This row reduction technique has the advantage of being easier...
The authors have proposed an approach for generating a pseudo random binary sequence by using primitive polynomial, trace function, and Legendre symbol over the proper sub extension field. There are many uses of pseudo random binary sequence in security applications. The linear complexity of a sequence is considered as the most important property to be analyzed in these types of applications. In this...
Pseudorandom number generators are required to generate pseudorandom numbers which have not only good statistical properties but also unpredictability in cryptography. A geometric sequence is a sequence given by applying a nonlinear feedforward function to an m-sequence. Nogami, Tada and Uehara proposed a geometric sequence whose nonlinear feedforward function is given by the Legendre symbol, and...
Digital Secret Unknown Cipher (SUC) has been proposed in the last decade targeting to counteract the drawbacks of the traditional analog Physical Unclonable Functions (PUF). The SUCs, as pure-digital units, exhibit consistent operation during the whole digital unit's lifetime. This makes SUCs as PUF alternatives attractive for practical creation of clone-resistant units for a broad spectrum of applications...
Smart-grids are currently of great social and scientific interest. For certain social actors, they have generated a great deal of expectation. There are several aspects to take into account when advocating for a universal implementation of smart-grids. Here we concentrate in their possibilities regarding the co-evolution between technical integration and social interaction. We propose a framework...
This paper is concerned with the fault detection (FD) problem for a class of networked systems. We introduce a novel communication protocol which is called the Round-Robin protocol (RRP) to overcome the limited communication capacity. Under the RRP protocol, sensor nodes are prearranged in a particular sequence, and communication between sensor and the receiving end is thus periodic. Such kind of...
Lattice-based cryptography has recently produced several time-efficient cryptosystems that are provably secure under assumptions that are not known to be more easily solvable by quantum computers. An interesting research direction is improving their storage complexity, as current solutions are far from practical with respect to this metric. In this paper we show that program obfuscators for point...
Harmonic cancelation strategies have been proposed as a promising solution for the implementation of accurate onchip sinusoidal signal generators while minimizing the required on-chip resources. Harmonic cancelation-based generators can be implemented using digital resources to provide a set of phaseshifted digital square-wave signals and a summing network built with passive or active components for...
The complexity of software implementations of MDS erasure codes mainly depends on the efficiency of the finite field operations implementation. In this paper, we propose a method to reduce the complexity of the finite field multiplication by using simple transforms between a field and a ring to perform the multiplication in a ring. We show that moving to a ring reduces the complexity of the operations...
The problem of analyzing the finite-length scaling behavior of sparse random linear codes is considered. Random linear codes with random generator matrices whose entries are picked according to i.i.d. Bernoulli distribution with parameter q = o(1) are called sparse. The parameter q is referred to as the sparsity of the random linear code. We develop a methodology to show the optimality of the scaling...
In this paper, we study of the performance of the concatenation of a short polar code with an outer binary linear block code from a distance spectrum viewpoint. Our analysis targets the case where an outer cyclic code is employed together with an inner systematic polar code. A concatenated code ensemble is defined placing an interleaver at the input of the polar encoder. The introduced ensemble allows...
We present new data structures for quasistrict higher categories, in which associativity and unit laws hold strictly. Our approach has low axiomatic complexity compared to traditional algebraic approaches, and gives a practical method for performing calculations in quasistrict 4-categories. It is amenable to computer implementation, and we exploit this to give a machine-verified algebraic proof that...
The AC optimal power flow problem is a non-convex optimization problem that is difficult to solve quickly and reliably for large-scale grids. To enable the application of efficient and robust solution algorithms, various linear approximations of the nonlinear system model are used. However, this may lead to solutions that are AC suboptimal or even infeasible. This paper proposes new linearization...
A two-step method is proposed to compute the antenna array parameters for reducing excitation complexity of plane wave generator in this paper. Both the least squares method and genetic algorithm are combined to figure out the phase and position of each unit with selected amplitude. The validity of the method is confirmed by computer simulation and virtual experiments.
It has been shown that spatially coupled low-density generator-matrix (SC-LDGM) code ensembles display distortion saturation for the lossy binary symmetric source coding problem with belief propagation guided decimation algorithms, in the sense that the distortion of the SC-LDGM code ensemble approaches the optimal distortion of the underlying (uncoupled) LDGM block code ensemble. This has also been...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.