A new test compression scheme is proposed by using a new DFT architecture, a new gating technique, and a new low-power test application scheme for circuits with a large number of unknown test response sources. A probabilistic measure is proposed to analyze the potential of scan flip-flops to capture unknown responses. All scan flip-flops with enough potential to capture unknown test responses are clustered to localize the effect of the unknown sources on fault coverage. A new test response compactor is presented to avoid unknown test responses and minimize fault coverage loss in the software-defined linear feedback shift-register (SLFSR) based test compression environment. Experimental results are presented to show the effectiveness of the new method.

At present, existing multi-receiver authentication (MRA) schemes can only handle situations where the capacities of all receivers in the schemes are the same. However, in reality, different receivers may need to have different storage capacities. In this paper, inspired by the secret sharing scheme based on the Chinese Remainder Theorem (CRT) for polynomial rings where each participant holds the share with different sizes, we propose three new constructions of unconditionally secure MRA schemes for multiple messages using the CRT for polynomial rings, including a$(k,n)$-threshold MRA scheme, a$(k,n,\omega)$-weighted threshold MRA scheme, and a$(\mathcal {Q},\mathcal {F})$-general MRA scheme. As far as we know, our proposed MRA schemes are the first MRA schemes with different storage capacities for different receivers and the first ones based on the CRT for polynomial rings. Moreover, the proposed schemes can be seen as extensions of the MRA scheme in Safavi-Naini and Wang. In particular, as for our$(\mathcal {Q},\mathcal {F})$-general MRA scheme, it has generally more communication complexity and much less computation complexity than the existing$(\mathcal {Q},\mathcal {F})$-general MRA scheme.

At present, existing multi-receiver authentication (MRA) schemes can only handle situations where the capabilities of all receivers are the same. However, in reality, different receivers may need to have different storage capabilities. In this paper, inspired by the secret sharing scheme based on the Chinese Remainder Theorem (CRT) for polynomial rings where distinct participants save shares with distinct sizes, we propose a new unconditionally secure MRA scheme for multiple messages by the same technique. As far as we know, our MRA scheme is the first MRA scheme with different storage capacities for different receivers and the first one based on the CRT for polynomial rings supporting general access structures. In contrast to the existing general MRA scheme, although our MRA scheme has more communication complexity, it has less computation complexity.

Logic built-in self-test and scan-based testability design are currently the mainstream solutions for large-scale integrated circuit testing. Phase shifters are widely used in these testing schemes because they can greatly improve the driving ability of test inputs and significantly improve the fault coverage of testing. A phase shifter is composed of an XOR network consisting of a certain number of multi-input XOR gates, and the correlation of the output sequence of the phase shifter has a significant impact on the testing performance. The classic constructing method of phase shifters has problems such as long running time, easy wiring conflicts during the actual synthesis and implementation of final circuits. Therefore, when encountering designs with large scanning units, they often face great difficulties. This article proposes a phase shifter constructing method based on grouping and random fan-in, which controls the register units that each scan chain excitation input depends on as much as possible within a local range, greatly reducing the computational time and wiring difficulty of phase shifter construction. At the same time, a linear feedback shift register bit with random fan-in is introduced to reduce the correlation between the output sequences of adjacent ports of the phase shifter. Using partial IWLS 2005 benchmark circuits and OpenCores test circuits, while ensuring the same test fault coverage for stuck-at faults and transition faults, this method reduces more than 30% running time to construct a phase shifter compared to classical methods. The phase shifter structures constructed for each test circuit are synthesized and implemented on Xilinx’s XC7V690T FPGA. The phase shifter constructed by this method consumes more than 20% less wiring resources than the phase shifter constructed by classical methods.

Linear codes generated by component functions of perfect nonlinear (PN for short) and almost perfect nonlinear (APN for short) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper is to investigate some binary shortened codes of two families of linear codes from APN functions and some$p$-ary shortened codes associated with PN functions. The weight distributions of these shortened codes and the parameters of their duals are determined. The parameters of these binary codes and$p$-ary codes are flexible. Many of the codes presented in this paper are optimal or almost optimal. The results of this paper show that the shortening technique is very promising for constructing good codes.

Authenticationis the first defence line to prevent malicious entities to accesssmart mobile devices(or SMD). Essentially, there exist many available cryptographic primitives to design authentication protocols.Oblivious transfer() protocol is one of the important cryptographic primitives to design authentication protocols. The first lattice‐based framework under universal composability (UC) model was designed by dual mode encryption and promoted us to find an alternative efficient scheme. We note that “lossy encryption” scheme is an extension of the dual mode encryption and can be used to design UC‐secure protocol, but the investigations of via lossy encryption over the lattice are absent. Hence, in order to obtain an efficient authentication protocol by improving the performance of the UC‐secure protocol, in this paper, we first design a multibit lossy encryption under the decisional learning with errors () assumption and then design a new variant of UC‐secure protocol for authenticated protocol via lossy encryption scheme. Additionally, our protocol is secure against semihonest (static) adversaries in the common reference string (CRS) model and within the UC framework.

In this paper, we investigate properties of generalized bent Boolean functions and 2k-bent (i.e., negabent, octabent, hexadecabent, et al.) Boolean functions in a uniform framework. From the Hadamard matrices, Hodzic and Pasalic presented sufficient conditions for generalized bent functions. Using cyclotomic fields and the decomposition of generalized bent functions, we generalize their results, prove that Hodzic and Pasalic's conditions of generalized bent functions are not only sufficient but also necessary, and completely characterize generalized bent functions in terms of their component functions. Furthermore, we present a secondary construction of bent functions or semibent functions from generalized bent functions. Finally, we give the relations of generalized bent functions and 2k-bent functions, demonstrate that 2k-bent functions are actually a special class of generalized bent functions, and completely characterize 2k-bent functions.

In this paper, we present a construction of linear codes over F2tfrom Boolean functions, which is a generalization of Ding's method. Based on this construction, we give two classes of linear codes C̃fand Cfover F2tfrom a Boolean function f : Fq→ F2, where q = 2nand F2tis some subfield of Fq. The complete weight enumerator of C̃fcan be easily determined from the Walsh spectrum of f , while the weight distribution of the code Cfcan also be easily settled. Particularly, the number of nonzero weights of C̃fand C f is the same as the number of distinct Walsh values of f. As applications of this construction, we show several series of linear codes over F2twith two or three weights by using bent, semibent, monomial and quadratic Boolean function f.

In this paper, a generic construction of codebooks based on binary codes is introduced. With this generic construction, a few previous constructions of optimal codebooks are extended, and a new class of codebooks almost meeting the Levenshtein bound is presented. Exponentially many codebooks meeting or almost meeting the Levenshtein bound from binary codes are obtained in this paper. The codebooks constructed in this paper have alphabet size 4. As a byproduct, three bounds on the parameters of binary codes are derived.