Cited by 57Cryptographic Implementations and SecurityCoding theory and cryptographyCryptography and Residue Arithmetic

A Comparison of Post-Processing Techniques for Biased Random Number Generators

Open access
Kwok, Siew-Hwee, Ee, Yen-Ling, Chew, Guanhan, Zheng, Kanghong, Khoo, Khoongming, Tan, Chik-How·2011·Lecture Notes in Computer Science

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-642-21040-2_12

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The Von Neumann generator has a large loss of data, as at least 75% of the input is discarded.

    “However, the big drawback of the Von Neumann generator is the large loss of data, as at least 75% of the input is being discarded. This implies that the input needs to be sufficiently large9,40.”

    From DNA synthesis for true random number generation (2020) · cites this paper as [9]

  • The output of the Von Neumann corrector is expected to be perfectly unbiased.

    “The output of the Von Neumann corrector is expected to be perfectly unbiased9,40,41”

    From DNA synthesis for true random number generation (2020) · cites this paper as [9]

  • The Von Neumann corrector does not introduce any additional source of randomness into the data.

    “Out of the existing options, we have chosen to apply the Von Neumann corrector to our set of data, as it is very simple to use, and does not introduce any additional source of randomness into the data, allowing the analysis of the random nature of the physical data9,40.”

    From DNA synthesis for true random number generation (2020) · cites this paper as [9]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Halevi, S.: Cryptographic Hash Functions and their many applications. In: USENIX Security Symposium (2009), http://people.csail.mit.edu/shaih/pubs/Cryptographic-Hash-Functions.ppt
  2. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptog- raphy. CRC Press, Boca Raton (1997)

Cited by

Sorted by citations

Authors
Kwok, S.-H., Ee, Y.-L., Chew, G., Zheng, K., Khoo, K., & Tan, C.-H.
Affiliations
  • DSO National Laboratories (SG)
  • National University of Singapore (SG)
Venue
Lecture Notes in Computer Science
Published
2011
Volume
LNCS-6633
Pages
175-190
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1564309918
Cited by
57
References
9
Citations by year
2026: 2 · 2025: 2 · 2024: 5 · 2023: 6 · 2022: 3 · 2021: 4 · 2020: 8 · 2019: 8 · 2018: 5 · 2017: 3 · 2016: 1 · 2015: 3 · 2014: 6 · 2013: 1
FWCI
1.72
Type
conference paper
Language
en
Open access
Locations
  • Lecture notes in computer science (publishedVersion)
  • National University of Singapore (submittedVersion)
  • HAL (submittedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
  • Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
Keywords
post-processing, linear compression, randomness extraction, throughput, FPGA implementation, hardware implementation, resource utilization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review