In many cryptographic applications, random numbers and pseudorandom numbers are required. Many cryptographic protocols require using random or pseudorandom numbers at various points, e.g., for auxiliary data in digital signatures or challenges in authentication protocols. In NIST SP800-22, the focus is on the need for randomness for encryption purposes and describes how to apply a set of statistical randomness tests. These tests can be used to evaluate the data generated by cryptographic algorithms. This paper will study the fast software implementation of the serial test and the approximate entropy test and propose two types of fast implementations of these tests. The first method is to follow the basic steps of these tests and replace bit operations with byte operations. Through this method, compared with the implementation of Fast NIST STS, the efficiency of the serial test and approximate entropy test is increased by 2.164 and 2.100 times, respectively. The second method is based on the first method, combining the statistical characteristics of subsequences of different lengths and further combining the two detections with different detection parameters. In this way, compared to the individual implementation of these tests, the efficiency has been significantly improved. Compared with the implementation of Fast NIST STS, the efficiency of this paper is increased by 4.078 times.

中文翻译：

---

二进制序列的串行测试和近似熵测试的快速软件实现

在许多密码应用中，需要随机数和伪随机数。许多密码协议需要在不同点使用随机数或伪随机数，例如，用于数字签名中的辅助数据或身份验证协议中的挑战。在 NIST SP800-22 中，重点是出于加密目的对随机性的需求，并描述了如何应用一组统计随机性测试。这些测试可用于评估密码算法生成的数据。本文将研究串行测试和近似熵测试的快速软件实现，并提出这些测试的两种快速实现。第一种方法是按照这些测试的基本步骤，用字节操作代替位操作。通过这种方法，与Fast NIST STS的实现相比，串行测试和近似熵测试的效率分别提高了 2.164 和 2.100 倍。第二种方法是在第一种方法的基础上，结合不同长度子序列的统计特征，进一步结合不同检测参数的两种检测。这样，相比单独执行这些测试，效率有了明显的提升。与Fast NIST STS的实现相比，本文的效率提高了4.078倍。结合不同长度子序列的统计特征，进一步结合不同检测参数的两种检测。这样，相比单独执行这些测试，效率有了明显的提升。与Fast NIST STS的实现相比，本文的效率提高了4.078倍。结合不同长度子序列的统计特征，进一步结合不同检测参数的两种检测。这样，相比单独执行这些测试，效率有了明显的提升。与Fast NIST STS的实现相比，本文的效率提高了4.078倍。