Lightweight Pseudorandom Number Generator Research Articles

Lightweight Pseudo Random Number Generator for Embedded Systems

Lightweight Pseudo Random Number Generator for Embedded Systems

Implementation of the NewHope Protocol for Post-Quantum Cryptography

In this paper, we propose a faster and less resource intensive implementation of the NewHope protocol to address the problems of resource-intensive random number generators and slow running NTT modules in NewHope implementations. In the random number generation module, choose the lightweight pseudo-random number generator (PRNG) Trivium instead of the SHAKE function to reduce the resource usage in the random number generation module. In the NTT transformation module, a pipeline structure is used in combination with a parallel structure of four butterfly units to shorten the cycle time of butterfly operations and achieve acceleration. The experimental results show that, compared with Kuo’s design, the overall time for key exchange in this paper is reduced by 25.3%, and the consumption of FFs and LUTs is reduced by 20.2% and 38.0%, respectively.

TESTING PSEUDORANDOM NUMBER SENSORS BUILT IN SMART CARDS

This article explores randomness and how general purpose computers generate it. It also discusses the security requirements that a pseudo-random number generator must satisfy for use in cryptographic applications. And also special attention is paid to the known and new methods of testing random bit sequences. Analyzing the effectiveness of pseudo-random sequence generators is a pressing problem for smart cards when using more advanced methods of encryption and information protection. The available methods show low flexibility and versatility in the means of finding hidden patterns in data. To solve this problem, it is proposed to use algorithms based on multivariate statistics. These algorithms combine all the advantages of statistical methods and are the only alternative for analyzing short and medium-length sequences. The paper considers the scheme of operation of pseudo-random number generators in limited devices. The main requirements for modern smart cards are highlighted. A criterion for checking the randomness of bit sequences of small length (up to 100 bits) is proposed. This approach is appropriate for testing a lightweight pseudo-random number generator in devices with certain resource constraints. The paper presents the compatible distributions of the number of 2-strings and the number of 3-strings of a fixed form of a random bit sequence, which make it possible to carry out a statistical analysis of local sections of this sequence. A possible application of the obtained formulas can be to test the hypothesis of the randomness of the arrangement of zeros and ones in a (0, 1) -sequence of finite length. Research has shown that even with limited resources and a limited entropy environment like a smart card, good quality pseudo-random sequences can be created that can satisfy all the requirements for pseudo-random number generators, even those used for general purpose computers. In the work, the set of statistical tests was expanded to include other tests that are not included in the statistical set of NIST tests, and to analyze the work of the proposed algorithms. The paper presents algorithms for testing a pseudo-random sequence using multivariate statistics to illustrate their possible application in a smart card environment.

Testing the pseudorandom number generator as a component of the security of the internet of things

Internet of Things (IoT) devices collect some volumes of data, some of which will require protection based on sensitivity or compliance requirements. IoT data protection solutions must span edge to cloud, provide scalable encryption and key management, and not impede data analysis. An analysis of recent research and publications shows a great deal of interest in finding various ways to develop lightweight pseudorandom number generators that have been widely used on the Internet of Things or mobile devices. These so-called lightweight IoT devices have limited power, space, and computing resources. Therefore, there is a huge need to develop and test the quality of lightweight pseudorandom number generators, which is an important component of cybersecurity. The available approaches to testing random or pseudorandom sequences show low flexibility and versatility in the means of finding hidden patterns in the data. It is revealed that for sequences of length up to 100 bits there are not enough existing statistical packets. The available techniques show low flexibility and versatility in the means of finding hidden patterns in the data. Perspective direction of research — static testing of sequences using multidimensional statistics is considered. To solve this problem, it is suggested to use algorithms based on multidimensional statistics. In the work, formulas are given and theorem for testing sequences for randomness, using two or three-dimensional statistics that can be used for small and medium-sized sequences is formulated. The new technique of PRS testing is proposed in the paper, and several criteria for testing bit sequence of small length are considered, which, in comparison with one-dimensional statistics, gives a more accurate result. As a result of the implementation of this technique, an information system can be created that will allow analyzing the PRS of a small length and choosing a quality PRS for use in the Internet of Things Security.

Protecting Private Communications in Cyber-Physical Systems through Physical Unclonable Functions

Cyber-physical systems (CPS) are envisioned to change the whole of society. New engineered systems joining physical and digital solutions are being employed in industry, education, etc. These new systems are networked by default, and private information is shared among the different components related to users, critical infrastructures, or business operations. In this context, it is essential to encrypt those communication links to protect such information. However, even most complicated schemes based on hybrid (asymmetric and symmetric) solutions, finally require physical devices to store a secret key. This approach is cryptographically weak, as any person with physical access to the device could obtain that key. Therefore, in this paper we propose the use of physical unclonable functions (PUF) to generate secret keys for lightweight encryption schemes. Using PUFs, any attempt to capture the key is changing the original secret stream, and even manufacturers are not able to build two identical PUFs. The proposed key generator is based on magnetic materials and lightweight pseudorandom number generators to meet the low-cost and small size requirements of CPS. In particular, materials with an activated exchange-bias effect are employed, together with simple copper coils. The encryption process can be based on a simple XOR gate because of the robustness of the proposed key generator. In order to evaluate the performance of the proposed technology, an experimental validation based on simulation scenarios is also provided.

Acoustic Lightweight Pseudo Random Number Generator based on Cryptographically Secure LFSR

Acoustic Lightweight Pseudo Random Number Generator based on Cryptographically Secure LFSR

An Intra-Slice Security Solution for Emerging 5G Networks Based on Pseudo-Random Number Generators

Future 5G networks must provide communication services to a great and heterogeneous collection of scenarios: from traditional mobile communications to emerging applications such as Industry 4.0 or the Internet of Things (IoT). In this context, the network slicing technique is defined, where network resources are packaged and assigned in an isolated manner to the sets of users according to their specific requirements. Two different domains are, thus, defined: the intra-slice domain (where dedicated and specific solutions have to be deployed) and the inter-slice domain (including transversal solutions). One of the key topics which should be redefined following this approach is security. Traditionally, some solutions (such as stream ciphers) were not considered in mobile networks. However, 5G systems will be extensively employed in other new and very distinct scenarios, where requirements are different. For example, the use of resource constrained devices with little mobility and real-time data streaming in certain IoT applications suggests the use of stream ciphers (and other similar techniques) as the main security solutions. Therefore, in this paper, we investigate and propose a new security solution for emerging 5G networks, to be applied in the intra-slice domain. The proposed solutions employ lightweight pseudo-random number generators in order to provide the keystream used in stream ciphers which protect the private information and hide the communication signals in the frequency spectrum using spread spectrum techniques. We also describe and evaluate a first implementation of the proposed solution, using both, a simulation scenario and a real deployment.

A Scalable and Lightweight Grouping Proof Protocol for Internet of Things Applications

The Internet of Things (IoT) is a new technology, which enables objects to exchange data via the internet network. One part of the infrastructure of IoT is Radio Frequency Identification (RFID). One way to fortify the system and prevent it against an unauthorized access is an authentication process. A grouping proof protocol is a protocol by which a reader authenticates two or more tags simultaneously in an authentication process. In this paper, we present a novel scalable grouping proof protocol. Since scalability is a challenge in grouping proof protocol, to solve the scalability problem in the proposed protocol, the reader broadcasts the messages and the tags respond to it independently. In terms of the performance, we use a 64-bit lightweight Pseudo-Random Number Generator (64-PRNG) function, which meets the needs of low-power and low-cost systems. In addition, the security analysis results prove that the proposed protocol is resistant against RFID threats and provides an acceptable security level and low computation cost.

A Lightweight Pseudorandom Number Generator for Securing the Internet of Things

Lightweight cryptography aims to address the security demands in resource-constrained hardware and software environments, such as the Internet of Things (IoT). These constraints severely limit solutions offered by conventional cryptographic primitives, which turn too expensive to achieve. In this paper, a lightweight pseudorandom number generator that fits the IoT demands is presented. It has a good performance on Atmel 8-bit AVR and Intel Curie 32-bit microcontrollers. The analysis of the hardware complexity in terms of gate equivalent confirms that it is suitable for the IoT.

A random number generator for lightweight authentication protocols: xorshiftR+

This paper presents the results of research that aims to find a suitable, reliable, and lightweight pseudorandom number generator for constrained devices used in the Internet of things. Within the study, three reduced versions of the xorshift+ generator are built. They are tested using the TestU01 suite as well as the NIST suite to measure their ability to produce randomness and performance values along with some other existing generators. The best of our reduced variations according to our tests, called the xorshiftR+, demonstrated great suitability for lightweight devices considering its randomness, performance, and resource usage.

Design and Implementation of Warbler Family of Lightweight Pseudorandom Number Generators for Smart Devices

With the advent of ubiquitous computing and the Internet of Things (IoT), the security and privacy issues for various smart devices such as radio-frequency identification (RFID) tags and wireless sensor nodes are receiving increased attention from academia and industry. A number of lightweight cryptographic primitives have been proposed to provide security services for resource-constrained smart devices. As one of the core primitives, a cryptographically secure pseudorandom number generator (PRNG) plays an important role for lightweight embedded applications. The most existing PRNGs proposed for smart devices employ true random number generators as a component, which generally incur significant power consumption and gate count in hardware. In this article, we present Warbler family, a new pseudorandom number generator family based on nonlinear feedback shift registers (NLFSRs) with desirable randomness properties. The design of the Warbler family is based on the combination of modified de Bruijn blocks together with a nonlinear feedback Welch-Gong (WG) sequence generator, which enables us to precisely characterize the randomness properties and to flexibly adjust the security level of the resulting PRNG. Some criteria for selecting parameters of the Warbler family are proposed to offer the maximum level of security. Two instances of the Warbler family are also described, which feature two different security levels and are dedicated to EPC C1 Gen2 RFID tags and wireless sensor nodes, respectively. The security analysis shows that the proposed instances not only can pass the cryptographic statistical tests recommended by the EPC C1 Gen2 standard and NIST but also are resistant to the cryptanalytic attacks such as algebraic attacks, cube attacks, time-memory-data tradeoff attacks, Mihaljević et al.’s attacks, and weak internal state and fault injection attacks. Our ASIC implementations using a 65nm CMOS process demonstrate that the proposed two lightweight instances of the Warbler family can achieve good performance in terms of speed and area and provide ideal solutions for securing low-cost smart devices.

Warbler: A Lightweight Pseudorandom Number Generator for EPC C1 Gen2 Passive RFID Tags

A pseudorandom number generator is an important component for implementing security functionalities on RFID tags. Most previous proposals focus on true random number generators that are usually inefficient for low-cost tags in terms of power consumption, area, and throughput. In this contribution, we propose a lightweight pseudorandom number generator (PRNG) for EPC Class-1 Generation-2 (EPC C1 Gen2) RFID tags. The proposed PRNG fully exploits nonlinear feedback shift registers and provides 16-bit random numbers that are required in the tag identification protocol of the EPC C1 Gen2 standard. The generated sequences are able to pass the EPC C1 Gen2 standard's statistical tests as well as the NIST randomness test suite. Moreover, a detailed cryptanalysis shows that the proposed PRNG is resistant to the most common attacks such as algebraic attacks, cube attacks, and time-memorydata tradeoff attacks. In particular, the proposed PRNG can be implemented on low-cost Xilinx Spartan-3 FPGA devices with 46 slices.