Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MobiQuitous)

On-line Entropy Estimation for Secure Information Reconciliation

Christian Zenger, Jan Zimmer, Jan-Felix Posielek, Christof Paar

Published Jan 1, 2015• 10 citations
Publisher

Abstract

The random number generator (RNG) is a critical, if not in fact the most important, component in every cryptographic device. Introducing the symmetric radio channel, represented by estimations of location-specific, reciprocal, and time- variant channel characteristics, as a common RNG is not a trivi
DOI
10.4108/eai.22-7-2015.2260196

Related papers

Cryptographic Standards for Random Number Generation

Leonardo Errati, Roberto La Scala, Mauro Patano

Random number generators (RNGs) are an often overlooked cornerstone for secure communications, cryptographic protocols, and scientific simulations. This workshop opens with an overview of the NIST framework for RNGs - from entropy sources to filters and test suites. An important conclusion is that the construction of secure, standardised Quantum RNGs is a multidisciplinary effort; this will be exemplified by an ongoing integration project for distributed IT infrastructures

•Jan 1, 2025•0 citations

Analysis and Improvement of Entropy Estimators in NIST SP 800-90B for Non-IID Entropy Sources

Shuangyi Zhu, Yuan Ma, Tianyu Chen +2 more

Random number generators (RNGs) are essential for cryptographic applications. In most practical applications, the randomness of RNGs is provided by entropy sources. If the randomness is less than the expected, the security of cryptographic applications could be undermined. Accurate entropy estimation is a critical method for the evaluation of RNG security, and significant overestimation and underestimation are both inadvisable. The NIST Special Publication 800-90B is one of the most common certifications for entropy estimation. It makes no assumption of the entropy source and provides min-entropy estimation results by a set of entropy estimators. It estimates the entropy sources in two tracks: the IID (independent and identically distributed) track and non-IID track. In practice, non-IID entropy sources are more common, as physical phenomenon, sampling process or external perturbation could cause the dependency of the outputs. In this paper, we prove that the Collision Estimate and the Compression Estimate in non-IID track could provide significant underestimates in theory. In order to accurately estimate the min-entropy of non-IID sources, we provide a formula of minentropybased on conditional probability, and propose a new estimator to approximate the result of this formula. Finally, we perform experiments to compare our estimator with the NIST estimators using simulated non-IID data. Results show that our estimator gives close estimates to the real min-entropy.

IACR Transactions on Symmetric Cryptology•Sep 19, 2017•27 citations

Quantum random number generators and their use in cryptography

Mario Stipčević

International Convention on Information and Communication Technology, Electronics and Microelectronics•Jan 1, 2011•0 citations

True Random Number Generators for Cryptography

Berk Sunar

Springer eBooks•Dec 10, 2008•61 citations

Mapping Cooperative Key Generation to Location-Based Security: A Study on Static Free-Space

Mohammad Reza Yari, Paeiz Azmi, Moslem Forouzesh

In secret key generation (SKG), both communicating parties require access to a reciprocal entropy source. Free-space communication fails to provide this due to its strong line-of-sight (LoS) link and absence of multipath scattering. In general, in a free-space environment, SKG faces two primary challenges: a low key generation rate (KGR) and heightened security threats due to a lack of spatial decorrelation. In static free-space environments, the lack of temporal variation further exacerbates challenges. This paper aims to identify and enhance techniques from SKG literature to enable a location-based approach for secure key establishment. Important solutions include exploiting channel phase information as a common measurable parameter, adopting mutual random phase injection to involve the eavesdropper in the eavesdropping process while improving KGR, and introducing geometric secrecy as a security evaluation framework. A principal design objective in geometric secrecy is reducing the vulnerability region to restrict eavesdropping opportunities. To accomplish this, we propose a cooperative key generation (CKG) scheme to shrink this region. In our proposed CKG scheme, the sampling time is primarily governed by the switching time between transmit and receive modes. For information reconciliation, a selection algorithm for a shortened Bose–Chaudhuri–Hocquenghem (SBCH) code is proposed, and SBCH combined with a cyclic redundancy check (CRC) corrects bit mismatches. Worst-case channel sampling and information reconciliation leakage rates are analyzed. The leftover hash lemma is applied during privacy amplification to render leaked information useless. Simulation results indicate that the proposed CKG scheme achieves enhanced effectiveness with increased the number of quantization levels, while a wider angular guard zone plays a critical role in improving the KGR.

IEEE Access•Jan 1, 2026•0 citations

Quantum Random Number Generators for Cryptography: Design and Evaluation

Puspak Pain, Arindam Sadhu, Kunal Das +1 more

Lecture notes in electrical engineering•Oct 10, 2021•5 citations
Random number generators (RNGs) are essential for cryptographic applications. In most practical applications, the randomness of RNGs is provided by entropy sources. If the randomness is less than the expected, the security of cryptographic applications could be undermined. Accurate entropy estimation is a critical method for the evaluation of RNG security, and significant overestimation and underestimation are both inadvisable. The NIST Special Publication 800-90B is one of the most common certifications for entropy estimation. It makes no assumption of the entropy source and provides min-entropy estimation results by a set of entropy estimators. It estimates the entropy sources in two tracks: the IID (independent and identically distributed) track and non-IID track. In practice, non-IID entropy sources are more common, as physical phenomenon, sampling process or external perturbation could cause the dependency of the outputs. In this paper, we prove that the Collision Estimate and the Compression Estimate in non-IID track could provide significant underestimates in theory. In order to accurately estimate the min-entropy of non-IID sources, we provide a formula of minentropybased on conditional probability, and propose a new estimator to approximate the result of this formula. Finally, we perform experiments to compare our estimator with the NIST estimators using simulated non-IID data. Results show that our estimator gives close estimates to the real min-entropy.
In secret key generation (SKG), both communicating parties require access to a reciprocal entropy source. Free-space communication fails to provide this due to its strong line-of-sight (LoS) link and absence of multipath scattering. In general, in a free-space environment, SKG faces two primary challenges: a low key generation rate (KGR) and heightened security threats due to a lack of spatial decorrelation. In static free-space environments, the lack of temporal variation further exacerbates challenges. This paper aims to identify and enhance techniques from SKG literature to enable a location-based approach for secure key establishment. Important solutions include exploiting channel phase information as a common measurable parameter, adopting mutual random phase injection to involve the eavesdropper in the eavesdropping process while improving KGR, and introducing geometric secrecy as a security evaluation framework. A principal design objective in geometric secrecy is reducing the vulnerability region to restrict eavesdropping opportunities. To accomplish this, we propose a cooperative key generation (CKG) scheme to shrink this region. In our proposed CKG scheme, the sampling time is primarily governed by the switching time between transmit and receive modes. For information reconciliation, a selection algorithm for a shortened Bose–Chaudhuri–Hocquenghem (SBCH) code is proposed, and SBCH combined with a cyclic redundancy check (CRC) corrects bit mismatches. Worst-case channel sampling and information reconciliation leakage rates are analyzed. The leftover hash lemma is applied during privacy amplification to render leaked information useless. Simulation results indicate that the proposed CKG scheme achieves enhanced effectiveness with increased the number of quantization levels, while a wider angular guard zone plays a critical role in improving the KGR.