With the advancement of the information age, the risk of information security keeps increasing. Randomness is the core of network and information system security, and it is the basic support of the entire network trust system. In this paper, we introduce the concept of Device-Independent Quantum Random Number Generator (DIQRNG), which provides randomness with the highest security level. To better integrate with Information and Communications Technology (ICT) systems, we propose the principle and architectural framework of a randomness beacon based on DIQRNG. It is a public service that can be applied in multiple scenarios, such as contract signing and confidential disclosure. Its related application cases are also currently being studied in the ITU QIT4N focus group.
With the advancement of the information age, the risk of information security keeps increasing. Randomness is the core of network and information system security, and it is the basic support of the entire network trust system. In this paper, we introduce the concept of Device-Independent Quantum Random Number Generator (DIQRNG), which provides randomness with the highest security level. To better integrate with Information and Communications Technology (ICT) systems, we propose the principle and architectural framework of a randomness beacon based on DIQRNG. It is a public service that can be applied in multiple scenarios, such as contract signing and confidential disclosure. Its related application cases are also currently being studied in the ITU QIT4N focus group.
With the advancement of the information age, the risk of information security keeps increasing. Randomness is the core of network and information system security, and it is the basic support of the entire network trust system. In this paper, we introduce the concept of Device-Independent Quantum Random Number Generator (DIQRNG), which provides randomness with the highest security level. To better integrate with Information and Communications Technology (ICT) systems, we propose the principle and architectural framework of a randomness beacon based on DIQRNG. It is a public service that can be applied in multiple scenarios, such as contract signing and confidential disclosure. Its related application cases are also currently being studied in the ITU QIT4N focus group.
Device-independent quantum random number generation (DIQRNG) is the gold standard for generating truly random numbers, as it can produce certifiably random numbers from untrusted devices. However, the stringent device requirements of traditional DIQRNG protocols have limited their practical applications. Here, we introduce Device-Independent Private Quantum Randomness Beacon (DIPQRB), a novel approach to generate random numbers from untrusted devices based on routed Bell tests. This method significantly relaxes the device requirements, enabling a more practical way of generating randomness from untrusted devices. By distributing the device requirements across a network of servers and clients, our proposal allows the server to operate high-performance devices while the clients can be equipped with more cost-effective devices. Moreover, the outputs of the client's device are also private, even against the server, which is essential in cryptographic applications. Therefore, DIPQRB provides a cost-effective method to generate secure and private random numbers from untrusted devices.
One of the solutions to the problem of secure communication is the Quantum Random Number Generators (QRNGs) which generate true randomness based on quantum mechanical principles.QRNGs are different from conventional pseudo random number generator in that they use quantum uncertainty to generate outputs which are very unpredictable.This work attempts to examine different QRNG architectures, study the possible integration of cryptographic frameworks with these architectures and highlight potential vulnerabilities in the integration of cryptographic frameworks with QRNG architectures.Post-processing techniques, i.e.Zero-Phase Component Analysis (ZPCA) and neural network based techniques are also studied to increase entropy and suppress environmental noise in QRNG systems.Key findings show that system jitter models based QRNG architectures are more scalable and less expensive for use in real world applications.Additionally, incorporating cryptographic protocols with the QRNGs endows them with the ability to resist quantum threats, and hence, provide better key distribution in the secure IoT communication frameworks.However, as security problems such as side channel attacks and hardware manipulation are still big issues.It also points out some of the emerging research trends including hybrid QRNG architectures, i.e., QRNG with classical PRNG to increase the entropy rate.As such, the proposed methodologies attempt to enhance QRNG scalability, security, and energy efficiency in cloud infrastructures, in mobile systems and in critical security environments.The advancement of these technologies will assume a crucial function in the advancement of quantum-safe frames for current advanced computerized foundation.
Quantum Random Number Generators (QRNGs) provide physically unpredictable entropy essential for cryptography, modeling, and scientific research. Local generation is preferred for the highest level of security, as it eliminates the risks associated with transmitting data over a network. At the same time, public QRNG web services accessible via the API serve as a valuable tool in cases where dedicated hardware is unavailable, enabling rapid integration into software prototypes, statistical testing, large-scale simulations, and educational projects. Combining local and remote sources makes it possible to optimize the balance between security, accessibility, and performance. This article helps to develop and justify a typical QRNG web service infrastructure, which includes functional components, security requirements, access interfaces (API), methods for quality control of randomness, and recommendations for scalability. The proposed infrastructure is intended to serve as a foundation for creating interoperable, secure, and efficient web services of quantum entropy sources.
Cryptography is the study and practice of secure communication with digital data and focuses on confidentiality, integrity, and authentication. Random number generators (RNGs) generate random numbers to enhance security. Even though the cryptographic algorithms are public and their strength depends on the keys, cryptoanalysis of encrypted ciphers can significantly contribute to the unveiling of the cipher’s key. Therefore, to ensure high data security over a network, researchers need to improve the randomness of keys as they develop cryptosystems. Quantum particles have a leading edge in advancing RNG technology as they can provide true randomness, unlike pseudo-random numbers generators (PRNGs). In order to increase the level of the security of cryptographic systems based on random numbers, this survey focuses on three objectives: Cryptosystems with related cryptographic attacks, RNG-based cryptosystems, and the design of quantum random number generators (QRNGs). This survey aims to provide researchers with information about the importance of RNG-based ciphers and various research techniques for QRNGs that can incorporate quantum-based true randomness in cryptosystems.
Device-independent random number generation (DIQRNG) is the most secure form of generating private randomness using quantum physical processes. Its strength lies in producing numbers that are impossible to predict by any eavesdropper restricted by the laws of quantum theory. Moreover, security is proven solely from observed measurement statistics, without the need to characterise or trust the devices used in random number generation. Implementing DIQRNG is, however, costly, as it requires high-quality entangled systems. It is therefore important to make the best use of available resources. In this work, we show that using projective measurements -- which are most readily implementable experimentally -- one can certify 2log(d) bits of device-independent randomness from a bipartite system of local dimension d for every d≥2, thus reaching the theoretically maximum possible rate of DIQRNG. We provide explicit protocols reaching 2log(d) bits based on mutually unbiased bases. Furthermore, we compute numerical bounds on the rate for the case of imperfect implementations, showing that our protocols are robust to experimental noise.