Cited by 101Physical Unclonable Functions (PUFs) and Hardware SecurityCryptographic Implementations and SecurityCoding theory and cryptography

A Design of Reliable True Random Number Generator for Cryptographic Applications

Bagini, Vittorio, Bucci, Marco·1999·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/3-540-48059-5_18

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Bagini, V., & Bucci, M.
Affiliations
Fondazione "Ugo Bordoni" (IT)
Venue
Lecture Notes in Computer Science
Published
1999
Pages
204-218
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W206222754
Cited by
101
References
18
Citations by year
2025: 5 · 2024: 4 · 2022: 4 · 2021: 2 · 2020: 11 · 2019: 9 · 2018: 8 · 2017: 4 · 2016: 2 · 2015: 2 · 2014: 5 · 2013: 4
FWCI
0.53
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Physical Unclonable Functions (PUFs) and Hardware Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
true random number generator, cryptographic randomness, bias suppression, failure analysis, analytical model, circuit parameter variation, hardware reliability

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