Pith. sign in

REVIEW 2 major objections 6 minor 27 references

FPGA-based Toeplitz Strong Extractor for Quantum Random Number Generators

T0 review · 2 major / 6 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read An FPGA-based Toeplitz strong extractor reports 26.57 Gbps at extraction ratio 0.3.

desk verdict Real FPGA work with a broken proof: the LFSR-seeded Toeplitz matrix has rank at most 25, and the 26.57 Gbps benchmark counts input bits, not output. read the letter →

arxiv 2505.02868 v1 pith:KOE6UTCM submitted 2025-05-03 quant-ph

Shubham Chouhan , Anurag K.S.V. , G. Raghavan , Kanaka Raju P This is my paper · ORCID
classification quant-ph
keywords ToeplitzhashingstrongextractorrandomnessextractionQRNGpost-processingFPGAimplementationleftoverhashlemmaquantumrandomnumbergeneratorstatisticaltesting
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Quantum random number generators need post-processing to turn biased raw bits into uniform output. This paper claims an FPGA-based Toeplitz strong extractor performs that distillation at 26.57 Gbps, a rate that would let a single post-processing channel keep pace with high-speed QRNG sources. The design runs 40 parallel blocks, uses a 25-bit LFSR to generate the Toeplitz seed, and validates the output with the SP 800-22 statistical tests. The reported speeds decrease as the extraction ratio increases, from 26.57 Gbps at 0.3 to 9.99 Gbps at 0.8.

What carries the argument

The central object is the Toeplitz string: a bit string of length $b_s + m - 1$ whose overlapping substrings define a Toeplitz matrix in which each descending diagonal is constant. Because of that symmetry, the extractor never stores the matrix; it shifts the string by one bit per clock and AND-XORs the shifted substring with the input block. Forty blocks run in parallel on the FPGA, and the seed for the string comes from a 25-bit LFSR clocked once per output bit.

What would settle it

Compute the rank of the Toeplitz matrix formed by any 1000-bit window of the LFSR output; if the rank is below $m=300$, then the extractor cannot provably produce 300 independent bits per block, and a chosen-seed test that fixes the 23 seed bits should reveal the output pattern.

Watch

Extended reading notes

Core claim

On its own terms, the paper claims that a Toeplitz strong extractor built from AND/XOR binary matrix multiplication on an FPGA can distill phase-noise QRNG raw data into nearly uniform bits at 26.57 Gbps with an extraction ratio of 0.3, and at proportionally lower rates (13.3 Gbps at 0.6, 9.99 Gbps at 0.8) as the ratio rises. The design processes 40 blocks of 1000 bits in parallel, shifting a Toeplitz string to form the matrix rows and accumulating parity checks per output bit. For a sample of 800,000 raw bits the authors evaluate min-entropy as 2.6 bits per 8-bit symbol, set the output length to m=300 with security parameter $2^{-12.5}$, and report that the extracted output passes the applicable SP 800-22 statistical tests.

Load-bearing premise

The load-bearing premise is that the Toeplitz string is a uniformly random seed in the sense required by the leftover hash lemma; the paper draws it from a 25-bit LFSR seeded with 23 raw-data bits, which limits the seed space to no more than $2^{25}$ strings and makes the effective rank of the 1000-bit Toeplitz matrix at most 25.

Editorial extensions

If this is right

  • At extraction ratio 0.3 the design sustains 26.57 Gbps; the speed falls to 9.99 Gbps at ratio 0.8.
  • Raising the extraction ratio costs additional clock cycles per output bit, which explains the monotone speed drop across the tested ratios.
  • For a stream long enough to amortize the 100,274-cycle startup overhead, the steady-state extraction rate is what matters for QKD use.
  • The extracted output passes the applicable SP 800-22 tests, with the random-excursion tests undefined because the sample is too short.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The reported throughput is a fabric-level benchmark; because the LFSR seed has only 25 bits of state, the per-block Toeplitz matrix has rank at most 25, so the leftover-hash-lemma guarantee does not carry the claimed 300 output bits per block.
  • A direct test of the extractor's security would be to replace the LFSR seed with a truly random seed refreshed each batch; the speed cost is the seed-transport bandwidth, and the paper does not budget for it.
  • The same 40-block architecture could be re-timed for an FFT-based Toeplitz product, which is named as future work; comparing the two on the same FPGA would separate the throughput gain of the parallel schedule from the matrix-multiplication structure.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 6 minor

Summary. The manuscript describes an FPGA implementation of a Toeplitz strong extractor for QRNG post-processing on a Xilinx VC709 board. Raw data of 8×10^5 bits from a phase-noise QRNG are processed in 40 parallel blocks of 1000 bits; a 25-bit LFSR generates the Toeplitz string, and the extractor multiplies each block by shifts of this string. With a reported min-entropy of 2.6 bits per 8-bit sample, the output length m=300 and security parameter ε=2^-12.5 are chosen via the leftover hash lemma. The paper reports a maximum extraction speed of 26.57 Gbps at an extraction ratio of 0.3 and validates the output with NIST STS 2.1.2. The central claims are the new single-channel post-processing benchmark and the provable-security framing of the extractor.

Significance. The parallel block architecture and explicit clock-cycle reporting are useful for QRNG post-processing design, and if the security claim were valid the implementation would be a competitive single-channel extractor benchmark. However, the two central claims—provable strong extraction and the 26.57 Gbps benchmark—are not supported: the LFSR-derived Toeplitz seed invalidates the leftover hash lemma, and the speed number divides raw input bits by extraction time instead of reporting the extracted output rate. The paper is therefore not a valid demonstration of a strong extractor in its current form.

major comments (2)
  1. [II-A and II-B: LFSR-based seed and Toeplitz extractor] The seed construction does not satisfy the leftover hash lemma. The Toeplitz string is generated by a 25-bit LFSR whose initial state contains only 23 bits sampled from the raw data plus two fixed ones. For a fixed seed, every row of the m×bs Toeplitz matrix is a linear function of the 25-bit LFSR state, so the matrix rank over GF(2) is at most 25. The per-block output T*x therefore lies in a subspace of dimension at most 25, and because there are at most 2^25 seeds, the entire output distribution for a block has support of size at most 2^50. A distribution supported on at most 2^50 points cannot be ε-close to uniform on {0,1}^300 for ε=2^-12.5; the statistical distance is essentially 1. This invalidates the strong-extractor guarantee and the m=300 parameter choice. In addition, using raw QRNG bits to seed the extractor violates the seed-independence requirement of the leftover hash lemma.
  2. [III, Table I and Fig. 4] The reported 'randomness extraction speed' is computed by dividing the full 800,000-bit raw sample by the extraction time, not by the 240,000 bits that the extractor actually outputs at ER=0.3. With 6021 clock cycles at 200 MHz, the extraction time is 30.105 μs; 800,000 bits divided by this time gives 26.57 Gbps, while the extracted output rate is 240,000 bits / 30.105 μs ≈ 7.97 Gbps. The benchmark should be reported on the output bit count. Also, the 100,274-cycle one-time overhead is excluded from Table I; for the single 800-kbit dataset this overhead is larger than the extraction cycles, and if included, the effective output rate is about 0.45 Gbps, so the paper should clarify whether the benchmark refers to the extraction core only.
minor comments (6)
  1. [II-A] The LFSR polynomial and tap positions are not specified, so the seed-generation and Toeplitz-string construction cannot be reproduced from the text.
  2. [III] The min-entropy value of 2.6 bits per 8-bit sample is asserted without describing the entropy model, the noise characterization, or a worst-case bound; the security parameter and the choice m=300 depend directly on this value.
  3. [III, Fig. 5] NIST STS results are not evidence of security: only 240 kbits (30 strings of 8000 bits) are tested, several tests are undefined, and the post-extraction failures are dismissed as sample-size limitations; statistical tests cannot substitute for the provable guarantee that the extractor is supposed to provide.
  4. [II-A and IV] There are typographical errors: 'Topelitz' in Section II-A and 'Teoplitz' in Section IV should be 'Toeplitz'.
  5. [III and IV] The conclusion that ER=0.6 gives 13.3 Gbps repeats the same input/output conflation; all speed claims should be restated in extracted output bits per second.
  6. [II and III] The authors state that hardware I/O interfacing was not performed during testing; the title and abstract should therefore qualify the reported speed as the extraction-core speed rather than an end-to-end post-processing throughput.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the 26.57 Gbps speed is a direct clock-cycle measurement, and the min-entropy-based m selection is a standard application of the leftover hash lemma rather than a fitted prediction.

full rationale

The paper's central performance claim is not circular: the extraction speed is computed directly from the reported number of clock cycles, the 200 MHz clock frequency, the block size, and the extraction ratio, with the relevant numbers given in Table I and Section III ('We achieved a maximum randomness extraction speed of 26.57 Gbps at an ER of 0.3'). The choice of m = 300 is obtained from the measured min-entropy of 2.6 bits per 8 bits via the leftover hash lemma; this is a standard use of an empirical entropy estimate to set an extractor parameter, not a prediction that is equivalent to the fit itself. No equation in the paper reduces to its own input, and no load-bearing argument rests on a self-citation or on a uniqueness theorem imported from the authors' prior work. The 25-bit LFSR seed issue identified by readers is a serious security and correctness limitation, because a short LFSR state cannot supply the uniform seed required by the leftover hash lemma, but that is a flaw in the application of the extractor rather than a circularity in the derivation chain. Accordingly, the appropriate circularity score is 0.

Assumptions & free parameters 4 free parameters · 4 assumptions · 0 invented entities

The central claims rest on a measured min-entropy value, a weakly seeded LFSR, a specific clock-cycle interpretation, and a fixed security parameter. No new physical entities are introduced.

free parameters (4)
  • Min-entropy per 8-bit sample = 2.6 bits per 8-bit sample
    Measured from the in-house phase-noise QRNG raw data and used to set m=300 via the leftover hash lemma. The measurement procedure is not described.
  • Security parameter epsilon = 2^{-12.5}
    Chosen by the authors; it determines the output length m. A standard choice, but it is a user-set value that controls the claimed extractor guarantee.
  • LFSR state and seed size = 25-bit LFSR, 23 seed bits from raw data plus 2 fixed ones
    Design choice in Section II-A that determines the Toeplitz string. The rank and security consequences are not analyzed.
  • Block size and parallel block count = bs=1000 bits, K=40 blocks
    Design parameters in Section II-B; these define the batch size L=4e4 and drive the clock-cycle counts in the speed calculation.
assumptions (4)
  • domain assumption The raw QRNG data has min-entropy 2.6 bits per 8-bit sample.
    Used to compute m=300. A reliable min-entropy estimate requires a source model and calibration, but no estimation details are given.
  • ad hoc to paper The LFSR-generated Toeplitz string can play the role of a uniform random seed in the leftover hash lemma.
    This is not true in general: the seed must be uniformly random and independent. A 25-bit LFSR gives at most 2^25 possible Toeplitz matrices and makes the matrix rank at most 25.
  • domain assumption NIST STS with 30 sequences of 8000 bits is sufficient to validate the output.
    The NIST suite generally recommends far more data for many tests. The paper's short sequences make several tests undefined and the p-values unstable.
  • domain assumption The clock-cycle counts in Table I cover the whole 800,000-bit sample rather than a single batch.
    The 26.57 Gbps number follows from dividing S=8e5 by the time for 6021 cycles. This only makes sense if 6021 cycles covers the whole sample, but the paper does not state whether the table is per batch or per sample.

how reviews work

0 comments
Cite this review

Pith. "Pith review of FPGA-based Toeplitz Strong Extractor for Quantum Random Number Generators." pith.science (2026). https://pith.science/paper/KOE6UTCM

@misc{pith2026250502868,
  author       = {Pith},
  title        = {Pith review of: FPGA-based Toeplitz Strong Extractor for Quantum Random Number Generators},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KOE6UTCM}},
  note         = {Machine review of arXiv:2505.02868}
}
read the original abstract

Quantum Random Number Generators (QRNGs) serve as high-entropy sources for Quantum Key Distribution (QKD) systems. However, the raw data from these quantum sources require post-processing to achieve a nearly uniform distribution. This work presents a state-of-the-art implementation of the Toeplitz Strong Extractor on an FPGA, achieving a benchmark extraction speed of 26.57 Gbps. A detailed implementation flow of the post-processing on the FPGA is provided, along with the execution speeds obtained for different randomness extraction ratios. Raw data from an in-house phase noise-based QRNG is processed on the FPGA using this implementation, and the output is validated using the NIST STS 2.1.2 statistical randomness test suite.

Figures

Figures reproduced from arXiv: 2505.02868 by the authors.

Figure 2
Figure 2. Implementation of Toeplitz Strong Extractor per Block. [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 1
Figure 1. Implementation of LFSR-based PRNG on FPGA. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. Execution Flow of the Toeplitz Strong Extractor on Xilinx VC709 FPGA. (bs) denotes a standard input block size of [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (1 more)
Figure 5
Figure 5. Figure 5: NIST STS 2.1.2 Randomness Tests Suite applied on (a) Raw Data of [PITH_FULL_IMAGE:figures/full_fig_p004_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 19 canonical work pages

  1. [1]

    Mutually testing source-device-independent quantum random number generator,

    J. Cheng, J. Qin, S. Liang, J. Li, Z. Yan, X. Jia, and K. Peng, “Mutually testing source-device-independent quantum random number generator,” Photon. Res. , vol. 10, no. 3, pp. 646–652, Mar 2022. [Online]. Available: https://opg.optica.org/prj/abstract.cfm?URI=prj-10-3-646

    work page 2022

  2. [2]

    Semi-device-independent quantum random number generator with a broadband squeezed state of light,

    J. Cheng, S. Liang, J. Qin, J. Li, Z. Yan, X. Jia, C. Xie, and K. Peng, “Semi-device-independent quantum random number generator with a broadband squeezed state of light,” npj Quantum Information, vol. 10, p. 1–8, 02 2024. [Online]. Available: https: //doi.org/10.1038/s41534-024-00814-z

    work page doi:10.1038/s41534-024-00814-z 2024

  3. [3]

    On- chip source-device-independent quantum random number generator,

    L. Li, M. Cai, T. Wang, Z. Tan, P. Huang, K. Wu, and G. Zeng, “On- chip source-device-independent quantum random number generator,” Photon. Res. , vol. 12, no. 7, pp. 1379–1394, Jul 2024. [Online]. Available: https://opg.optica.org/prj/abstract.cfm?URI=prj-12-7-1379

    work page 2024

  4. [4]

    Measurement-device-independent quantum random number generation over 23 mbps with imperfect single-photon sources,

    Y .-Q. Nie, H. Zhou, B. Bai, Q. Xu, X. Ma, J. Zhang, and J.-W. Pan, “Measurement-device-independent quantum random number generation over 23 mbps with imperfect single-photon sources,” Quantum Science and Technology, vol. 9, no. 2, p. 025024, apr 2024. [Online]. Available: https://dx.doi.org/10.1088/2058-9565/ad34f4

    doi:10.1088/2058-9565/ad34f4 2024

  5. [5]

    18.8 Gbps real-time quantum random number generator with a photonic integrated chip,

    B. Bai, J. Huang, G.-R. Qiao, Y .-Q. Nie, W. Tang, T. Chu, J. Zhang, and J.-W. Pan, “18.8 Gbps real-time quantum random number generator with a photonic integrated chip,” Applied Physics Letters, vol. 118, no. 26, p. 264001, 06 2021. [Online]. Available: https://doi.org/10.1063/5.0056027

    work page doi:10.1063/5.0056027 2021

  6. [6]

    240 gbps quantum random number generator with photonic integrated chip,

    S. Q. Ng, G. Zhang, C. Wang, and C. Lim, “240 gbps quantum random number generator with photonic integrated chip,” CLEO 2023, Technical Digest Series. Optica Publishing Group, 2023. [Online]. Available: https://doi.org/10.1364/CLEO AT.2023.AM4N.6

    work page doi:10.1364/cleo 2023

  7. [7]

    A fast and robust quantum random number generator with a self-contained integrated photonic randomness core,

    D. G. Marangon, P. R. Smith, N. Walk, T. K. Para ¨ıso, J. F. Dynes, V . Lovic, M. Sanzaro, T. Roger, I. De Marco, M. Lucamarini, Z. Yuan, and A. J. Shields, “A fast and robust quantum random number generator with a self-contained integrated photonic randomness core,” Nature Electronics, vol. 7, p. 396–404, 05 2024. [Online]. Available: https://doi.org/10....

    work page doi:10.1038/s41928-024-01140-0 2024

  8. [8]

    Real-time 50-gbit/s spatially multiplexed quantum random number generator based on vacuum fluctuation,

    K. Tanizawa, K. Kato, and F. Futami, “Real-time 50-gbit/s spatially multiplexed quantum random number generator based on vacuum fluctuation,” Journal of Lightwave Technology , vol. 42, no. 4, pp. 1209–1214, 2024. [Online]. Available: https://doi.org/10.1109/JLT.2024. 3353268

    doi:10.1109/jlt.2024 2024

Show all 27 references
  1. [9]

    A fast and compact quantum random number generator,

    T. Jennewein, U. Achleitner, G. Weihs, H. Weinfurter, and A. Zeilinger, “A fast and compact quantum random number generator,” Review of Scientific Instruments , vol. 71, pp. 1675–1680, 04 2000. [Online]. Available: https://doi.org/10.1063/1.1150518

    doi

  2. [10]

    Random optical pulse generation with bistable semiconductor ring lasers,

    S. Sunada, T. Harayama, K. Arai, K. Yoshimura, K. Tsuzuki, A. Uchida, and P. Davis, “Random optical pulse generation with bistable semiconductor ring lasers,” Opt. Express, vol. 19, no. 8, pp. 7439–7450, Apr 2011. [Online]. Available: https://doi.org/10.1364/OE.19.007439

    2011 doi

  3. [11]

    All- optical quantum random bit generation from intrinsically binary phase of parametric oscillators,

    A. Marandi, N. C. Leindecker, K. L. V odopyanov, and R. L. Byer, “All- optical quantum random bit generation from intrinsically binary phase of parametric oscillators,” Opt. Express, vol. 20, no. 17, pp. 19 322–19 330, Aug 2012. [Online]. Available: https://doi.org/10.1364/OE....

    2012 doi

  4. [12]

    Integrated gbps quantum random number generator with real-time extraction based on homodyne detection,

    L. Huang and H. Zhou, “Integrated gbps quantum random number generator with real-time extraction based on homodyne detection,” J. Opt. Soc. Am. B , vol. 36, no. 3, pp. B130–B136, Mar 2019. [Online]. Available: https://doi.org/10.1364/JOSAB.36.00B130

    2019 doi

  5. [13]

    Homodyne-based quantum random number generator at 2.9 gbps secure against quantum side-information,

    T. Gehring, C. Lupo, A. Kordts, D. Solar Nikolic, N. Jain, T. Rydberg, T. B. Pedersen, S. Pirandola, and U. L. Andersen, “Homodyne-based quantum random number generator at 2.9 gbps secure against quantum side-information,” Nature Communications , vol. 12, p. 605, 01 2021. [Onl...

    2021 doi

  6. [14]

    Provably-secure quantum randomness expansion with uncharacterized homodyne detection,

    C. Wang, I. W. Primaatmaja, H. J. Ng, J. Y . Haw, R. Ho, J. Zhang, G. Zhang, and C. Lim, “Provably-secure quantum randomness expansion with uncharacterized homodyne detection,” Nature Communications , vol. 14, 01 2023. [Online]. Available: https://doi.org/10.1038/s41467-022-35556-z

    2023 doi

  7. [15]

    100- gbit/s integrated quantum random number generator based on vacuum fluctuations,

    C. Bruynsteen, T. Gehring, C. Lupo, J. Bauwelinck, and X. Yin, “100- gbit/s integrated quantum random number generator based on vacuum fluctuations,” PRX Quantum , vol. 4, p. 010330, Mar 2023. [Online]. Available: https://link.aps.org/doi/10.1103/PRXQuantum.4.010330

    2023 doi

  8. [16]

    The generation of 68 Gbps quantum random number by measuring laser phase fluctuations,

    Y .-Q. Nie, L. Huang, Y . Liu, F. Payne, J. Zhang, and J.-W. Pan, “The generation of 68 Gbps quantum random number by measuring laser phase fluctuations,” Review of Scientific Instruments , vol. 86, no. 6, p. 063105, 06 2015. [Online]. Available: https://doi.org/10.1063/1.4922417

    2015 doi

  9. [17]

    Generation of random numbers by measuring phase fluctuations from a laser diode with a silicon-on-insulator chip,

    F. Raffaelli, P. Sibson, J. E. Kennard, D. H. Mahler, M. G. Thompson, and J. C. F. Matthews, “Generation of random numbers by measuring phase fluctuations from a laser diode with a silicon-on-insulator chip,” Opt. Express, vol. 26, no. 16, pp. 19 730–19 741, Aug 2018. [Online]...

    2018 doi

  10. [18]

    Phase randomness in a semiconductor laser: Issue of quantum random-number generation,

    R. Shakhovoy, M. Puplauskis, V . Sharoglazova, A. Duplinskiy, D. Sych, E. Maksimova, S. Hydyrova, A. Tumachek, Y . Mironov, V . Kovalyuk, A. Prokhodtsov, G. Goltsman, and Y . Kurochkin, “Phase randomness in a semiconductor laser: Issue of quantum random-number generation,” Phy...

    2023 doi

  11. [19]

    Kollmitzer, S

    C. Kollmitzer, S. Schauer, S. Rass, and B. Rainer, Quantum Random Number Generation. Springer, 02 2020

    2020

  12. [20]

    Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction,

    X. Ma, F. Xu, H. Xu, X. Tan, B. Qi, and H.-K. Lo, “Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction,” Physical Review A , vol. 87, 06 2013. [Online]. Available: https://10.1103/physreva.87.062327

    2013 doi

  13. [21]

    Parallel and real-time post-processing for quantum random number generators,

    X. Guo, F. Lin, J. Lin, Z. Song, Y . luo, Q. Wang, and Y . Guo, “Parallel and real-time post-processing for quantum random number generators,”

  14. [22]

    Ultrafast quantum random number generation based on quantum phase fluctuations,

    F. Xu, B. Qi, X. Ma, H. Xu, H. Zheng, and H.-K. Lo, “Ultrafast quantum random number generation based on quantum phase fluctuations,” Opt. Express, vol. 20, no. 11, pp. 12 366–12 377, May 2012. [Online]. Available: https://doi.org/10.1364/OE.20.012366

    2012 doi

  15. [23]

    Fpga implementation of toeplitz hashing extractor for real time post-processing of raw random numbers

    X. Zhang, Y .-Q. Nie, H. Liang, and J. Zhang, “Fpga implementation of toeplitz hashing extractor for real time post-processing of raw random numbers.” 2016 IEEE-NPSS Real Time Conference (RT), 2016, pp. 1–5. [Online]. Available: https://doi.org/10.1109/RTC.2016.7543094

    2016

  16. [24]

    6 gbps real-time optical quantum random number generator based on vacuum fluctuation,

    Z. Zheng, Y . Zhang, W. Huang, S. Yu, and H. Guo, “6 gbps real-time optical quantum random number generator based on vacuum fluctuation,” Review of Scientific Instruments , vol. 90, p. 043105, 04

  17. [25]

    Special publication 800-22 revision 1a a statistical test suite for random and pseudorandom number generators for cryptographic applications,

    A. Rukhin, J. Soto, J. Nechvatal, M. Smid, E. Barker, S. Leigh, M. Levenson, M. Vangel, D. Banks, A. Heckert, J. Dray, and S. V o, “Special publication 800-22 revision 1a a statistical test suite for random and pseudorandom number generators for cryptographic applications,” 04...

    2010 doi

  18. [2019]

    Available: https://10.1063/1.5078547

    [Online]. Available: https://10.1063/1.5078547

    doi

  19. [2024]

    Available: https://doi.org/10.48550/arXiv.2403.19479

    [Online]. Available: https://doi.org/10.48550/arXiv.2403.19479

    doi arXiv

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.