Logic encryption is an IC protection technique which inserts extra logic and key inputs to hide a circuit's functionality. An encrypted circuit needs to be activated with a secret key for being functional. SAT attack and Removal attack are two most advanced decryption methods that have shown their effectiveness to break most of the existing logic encryption methods within a few hours. In this paper, we propose SMARTLock, a SAT attack and reMoval Attack-Resistant Tree-based logic Locking method, for resisting them simultaneously. To encrypt a circuit, the method finds large AND and OR functions in it and encrypts them by inserting duplicate tree functions. There are two types of structurally identical tree encryptions that aim to resist SAT attack and Removal attack, respectively. The experimental results show that the proposed method is effective for encrypting a set of benchmarks from ISCAS'85, MCNC, and IWLS. 16 out of 40 benchmarks encrypted by the proposed method with the area overhead of no more than 5% are uncrackable by SAT attack within 5 hours. Additionally, compared to the state-of-the-art logic encryption methods, the proposed method provides better security for most benchmarks.

A consecutive-k-out-of-n:G system consists of n components which are arranged in a line and the system works if and only if at least k consecutive components work. This paper discusses the optimization problems for a consecutive-k-out-of-n:G system. We first focus on the optimal number of components at the system design phase. Then, we focus on the optimal replacement time at the system operation phase by considering a preventive replacement, which the system is replaced at the planned time or the time of system failure which occurs first. The expected cost rates of two optimization problems are considered as objective functions to be minimized. Finally, we give study cases for the proposed optimization problems and evaluate the feasibility of the policies.

Semi-bent functions have almost maximal nonlinearity. In this paper, two classes of semi-bent functions are constructed by modifying the supports of two quadratic Boolean functions $f_1(x_1,x_2,cdots,x_n)=igopluslimits^{k}_{i=1}x_{2i-1}x_{2i}$ with $n=2k+1geq3$ and $f_2(x_1,x_2,cdots,x_n)=igopluslimits^{k}_{i=1}x_{2i-1}x_{2i}$ with $n=2k+2geq4$. Meanwhile, the algebraic normal forms of the newly constructed semi-bent functions are determined.

The interval in ℕ composed of finite states of the stream version of asymmetric binary systems (ABS) is irreducible if it admits an irreducible finite-state Markov chain. We say that the stream version of ABS is irreducible if its interval is irreducible. Duda gave a necessary condition for the interval to be irreducible. For a probability vector (p,1-p), we assume that p is irrational. Then, we give a necessary and sufficient condition for the interval to be irreducible. The obtained conditions imply that, for a sufficiently small ε, if p∈(1/2,1/2+ε), then the stream version of ABS could not be practically irreducible.

With the rapid development of technology and economy, the number of cars is increasing rapidly, which brings a series of traffic problems. To solve these traffic problems, the development of intelligent transportation systems are accelerated in many cities. While vehicles and their detailed information detection are great significance to the development of urban intelligent transportation system, the traditional vehicle detection algorithm is not satisfactory in the case of complex environment and high real-time requirement. The vehicle detection algorithm based on motion information is unable to detect the stationary vehicles in video. At present, the application of deep learning method in the task of target detection effectively improves the existing problems in traditional algorithms. However, there are few dataset for vehicles detailed information, i.e. driver, car inspection sign, copilot, plate and vehicle object, which are key information for intelligent transportation. This paper constructs a deep learning dataset containing 10,000 representative images about vehicles and their key information detection. Then, the SSD (Single Shot MultiBox Detector) target detection algorithm is improved and the improved algorithm is applied to the video surveillance system. The detection accuracy of small targets is improved by adding deconvolution modules to the detection network. The experimental results show that the proposed method can detect the vehicle, driver, car inspection sign, copilot and plate, which are vehicle key information, at the same time, and the improved algorithm in this paper has achieved better results in the accuracy and real-time performance of video surveillance than the SSD algorithm.

In this letter, we simulate GNSS/LEO measurements and propose a process strategy for LEO-augmented GNSS medium length baseline RTK. Experiments show that, the performance of GNSS medium length baseline RTK can be significantly improved by introducing LEO satellites. The convergence speed of LEO-augmented GPS or BDS float solution maybe better than GPS/BDS combined under the conditions of similar satellite geometry. Besides, the RMS error of fixed solutions are improved to better than 4cm from sub-decimeter level.

Periodic sequences, used as keys in cryptosystems, plays an important role in cryptography. Such periodic sequences should possess high linear complexity to resist B-M algorithm. Sequences constructed by cyclotomic cosets have been widely studied in the past few years. In this paper, the linear complexity of n-periodic cyclotomic sequences of order 2 and 4 over 𝔽_p has been calculated, where n and p are two distinct odd primes. The conclusions reveal that the presented sequences have high linear complexity in many cases, which indicates that the sequences can resist the linear attack.

Difference systems of sets (DSSs) introduced by Levenstein are combinatorial structures used to construct comma-free codes for synchronization. In this letter, two classes of optimal DSSs are presented. One class is obtained based on q-ary ideal sequences with d-form property and difference-balanced property. The other class of optimal and perfect DSSs is derived from perfect ternary sequences given by Ipatov in 1995. Compared with known constructions (Zhou, Tang, Optimal and perfect difference systems of sets from q-ary sequences with difference-balanced property, Des. Codes Cryptography, 57(2), 215-223, 2010), the proposed DSSs lead to comma-free codes with nonzero code rate.

The packet error rate (PER) performance of multi-hop STBC based cooperative and diversity relaying systems are studied. These systems consist of a source, a destination, and two relay stations in each hop. From in-lab experiments, it is confirmed that the cooperative relaying system has better PER performance than the diversity relaying system with highly correlated channels.

Device-to-device (D2D) content delivery reduces the energy consumption of frequent content retrieval in future content-centric cellular networks based on proximal content delivery. Compared with unicast, multicast may be more efficient since it serves the content requests of multiple users simultaneously. The serving efficiency mainly depends on the selection of multicast transmitter, which has not been well addressed. In this letter, we consider the match degree between the multicast content of transmitter and the required content of receiver based on social relationship between transceivers. By integrating the effects of communication environments and match degree into the selection procedure, a multicast UE selection scheme is proposed to improve the number of benefited receivers from D2D multicast. Simulation results show that the proposed scheme can efficiently improve the performance of D2D multicast content delivery under different communication environments.