Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Overview of Randomness Test on Cryptographic Algorithms

View through CrossRef
Abstract Randomness is an important research topic in the field of information security, especially in cryptography. Randomness test techniques are used to examine the quality of random numbers so that they meet the requirements of the application. The randomness of cryptographic algorithms is one of the key concerns in the algorithm design. People have put forward different standards and test requirements for the randomness of cryptographic algorithms, as well as developed corresponding randomness test kits. This paper analyzes the randomness test technologies of cryptographic algorithms and the general randomness test methods, and compares them on this basis. At the end, the actual application scenarios to apply these randomness test methods are discussed.
Title: Overview of Randomness Test on Cryptographic Algorithms
Description:
Abstract Randomness is an important research topic in the field of information security, especially in cryptography.
Randomness test techniques are used to examine the quality of random numbers so that they meet the requirements of the application.
The randomness of cryptographic algorithms is one of the key concerns in the algorithm design.
People have put forward different standards and test requirements for the randomness of cryptographic algorithms, as well as developed corresponding randomness test kits.
This paper analyzes the randomness test technologies of cryptographic algorithms and the general randomness test methods, and compares them on this basis.
At the end, the actual application scenarios to apply these randomness test methods are discussed.

Related Results

A comprehensive review of post-quantum cryptography: Challenges and advances
A comprehensive review of post-quantum cryptography: Challenges and advances
One of the most crucial measures to maintain data security is the use of cryptography schemes and digital signatures built upon cryptographic algorithms. The resistance of cryptogr...
Randomness and invariance
Randomness and invariance
Abstract Richard von Mises was the first to provide a rigorous definition of randomness for infinite binary sequences, taken to represent indefinitely long sequen...
Improved device-independent randomness expansion rates using two sided randomness
Improved device-independent randomness expansion rates using two sided randomness
Abstract A device-independent randomness expansion (DIRE) protocol aims to take an initial random string and generate a longer one, where the security of the prot...
Provocative Tests in Diagnosis of Thoracic Outlet Syndrome: A Narrative Review
Provocative Tests in Diagnosis of Thoracic Outlet Syndrome: A Narrative Review
Abstract Thoracic outlet syndrome (TOS) is a group of conditions caused by the compression of the neurovascular bundle within the thoracic outlet. It is classified into three main ...
Complexity Theory
Complexity Theory
The workshop Complexity Theory was organised by Joachim von zur Gathen (Bonn), Oded Goldreich (Rehovot), Claus-Peter Schnorr (Frankfurt), an...
Next-Generation Cryptographic Security in Multi-Cloud Enterprises: AI-Enhanced Data Privacy, Protection, and Threat-Resilient Automation
Next-Generation Cryptographic Security in Multi-Cloud Enterprises: AI-Enhanced Data Privacy, Protection, and Threat-Resilient Automation
Enterprise architectures with multiple clouds have brought unprecedented complexity to cryptographic security management, demanding out-of-the-box solutions that go beyond the old ...
Exploring Randomness in Autism
Exploring Randomness in Autism
Introduction: The fast, intuitive and autonomous system 1 along with the slow, analytical and more logical system 2 constitute the dual system processing model of decision making. ...
QUANTUM MEASUREMENTS AND ALGORITHMIC RANDOMNESS
QUANTUM MEASUREMENTS AND ALGORITHMIC RANDOMNESS
Abstract Nies and Scholz formalized the notion of an infinite qubitstring and referred to it as a ‘state’. They defined ‘quantum Martin-Löf randomness’ for states...

Back to Top