A fully CMOS true random number generator based on hidden attractor hyperchaotic system

Low-power devices used in Internet-of-things networks have been short of security due to the high power consumption of random number generators. This paper presents a low-power hyperchaos-based true random number generator, which is highly recommended for secure communications. The proposed system, which is based on a four-dimensional chaotic system with hidden attractors and oscillators, exhibits rich dynamics. Numerical analysis is provided to verify the dynamic characteristics of the proposed system. A fully customized circuit is deployed using 130 nm CMOS technology to enable integration into low-power devices. Four output signals are used to seed a SHIFT-XOR-based chaotic data post-processing to generate random bit output. The chip prototype was simulated and tested at 100 MHz sampling frequency. The hyperchaotic circuit consumes a maximum of 980 μ W in generating chaotic signals while dissipates a static current of 623 μ A. Moreover, the proposed system provides ready-to-use binary random bit sequences which have passed the well-known statistical randomness test suite NIST SP800-22. The proposed novel system design and its circuit implementation provide a best energy efficiency of 4.37 pJ/b at a maximum sampling frequency of 100 MHz

Wireless communication with chaos

Peer reviewedPublisher PD

Softwarized resource allocation in digital twins-empowered networks for future quantum-enabled consumer applications

Network softwarization (NetSoft), recognized as crucial attribute of 6G networks, promises to provide enhanced and advanced services, including future quantum-enabled consumer applications. Softwarized resource allocation is the core issue in NetSoft concept. Digital twins (DT) guarantees to generate the corresponding digital world that reflects and interacts with the original physical world seamlessly. With DT empowering, the digital replica of softwarized networks can be generated to predict, simulate, analyze the softwarized resource allocation in more economical, convenient and scalable methods.In this paper, we research the softwarized resource allocation of requested services, usually, called as slices, in DT-empowered networks for future quantum-enabled consumer applications. We focus on developing efficient softwarized resource allocation algorithm. At first, we present models of the DT-empowered networks and service requests by using graph theory and hypergraph theory. Then, we design one softwarized resource management framework, labeled as DT-Slice-Soft-6G. This framework has the functions of managing softwarized resources, calculating resource allocation solution in digital replica and sending the calculated solution back to softwarized 6G networks. Thereafter, one efficient and fine-grained softwarized resource allocation algorithm, inserted in DT-Slice-Soft-6G, is detailed. This algorithm is labeled as Heu-DT-Slice-6G and is proposed based on efficient heuristic methods. To validate the highlights of DT-Slice-Soft-6G and Heu-DT-Slice-6G, we conduct the simulation work in our self-developed simulator

Sec12 Binds to Sec16 at Transitional ER Sites

COPII vesicles bud from an ER domain known as the transitional ER (tER). Assembly of the COPII coat is initiated by the transmembrane guanine nucleotide exchange factor Sec12. In the budding yeast Pichia pastoris, Sec12 is concentrated at tER sites. Previously, we found that the tER localization of P. pastoris Sec12 requires a saturable binding partner. We now show that this binding partner is Sec16, a peripheral membrane protein that functions in ER export and tER organization. One line of evidence is that overexpression of Sec12 delocalizes Sec12 to the general ER, but simultaneous overexpression of Sec16 retains overexpressed Sec12 at tER sites. Additionally, when P. pastoris Sec12 is expressed in S. cerevisiae, the exogenous Sec12 localizes to the general ER, but when P. pastoris Sec16 is expressed in the same cells, the exogenous Sec12 is recruited to tER sites. In both of these experimental systems, the ability of Sec16 to recruit Sec12 to tER sites is abolished by deleting a C-terminal fragment of Sec16. Biochemical experiments confirm that this C-terminal fragment of Sec16 binds to the cytosolic domain of Sec12. Similarly, we demonstrate that human Sec12 is concentrated at tER sites, likely due to association with a C-terminal fragment of Sec16A. These results suggest that a Sec12–Sec16 interaction has a conserved role in ER export

Cognitive radio network with secrecy and interference constraints

In this paper, we investigate the physical-layer security of a secure communication in single-input multiple-output (SIMO) cognitive radio networks (CRNs) in the presence of two eavesdroppers. In particular, both primary user (PU) and secondary user (SU) share the same spectrum, but they face with different eavesdroppers who are equipped with multiple antennas. In order to protect the PU communication from the interference of the SU and the risks of eavesdropping, the SU must have a reasonable adaptive transmission power which is set on the basis of channel state information, interference and security constraints of the PU. Accordingly, an upper bound and lower bound for the SU transmission power are derived. Furthermore, a power allocation policy, which is calculated on the convex combination of the upper and lower bound of the SU transmission power, is proposed. On this basis, we investigate the impact of the PU transmission power and channel mean gains on the security and system performance of the SU. Closed-form expressions for the outage probability, probability of non-zero secrecy capacity, and secrecy outage probability are obtained. Interestingly, our results show that the strong channel mean gain of the PU transmitter to the PU's eavesdropper in the primary network can enhance the SU performance. SafeCOP - Safe Cooperating Cyber-Physical Systems using Wireless Communicatio

Self-Regulation in Self-Organising Multi-Agent Systems for Adaptive and Intelligent Manufacturing Control

International audienceIn this paper, we explore the potential of distributed satisfaction techniques as to provide self-regulated manufacturing control. This work relies on a DisCSP-based modeling distributed among agents (e.g. machines) having enough and reasoning capabilities to cooperate and negotiate for a committed schedule. This approach is used to dynamically regulate the system (the network of machines) when perturbations occur (machine break-out, operator or container unavailability, or even priority command). Thus, for these machines, embodied intelligence and autonomy are a mean to provide a more flexible and adaptive manufacturing network. In this paper, we present two different multi-agent models and two extensions of well-known DisCSP solvers. Experiments using a dedicated simulation platform, MASC, are presented and discussed