1994
DOI: 10.17487/rfc1750
|View full text |Cite
|
Sign up to set email alerts
|

Randomness Recommendations for Security

Abstract: Randomness Recommendations for Security Status of this MemoThis memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. AbstractSecurity systems today are built on increasingly strong cryptographic algorithms that foil pattern analysis attempts. However, the security of these systems is dependent on generating secret quantities for passwords, cryptographic keys, and similar quantities. The use of pseudo-random pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
74
0
2

Year Published

2002
2002
2017
2017

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 125 publications
(76 citation statements)
references
References 0 publications
0
74
0
2
Order By: Relevance
“…The nonces should be generated by using a random number generator that is known to have good randomness properties [1]. A correspondent node may use the same Kcn and nonce with all the mobiles it is in communication with.…”
Section: Noncesmentioning
confidence: 99%
“…The nonces should be generated by using a random number generator that is known to have good randomness properties [1]. A correspondent node may use the same Kcn and nonce with all the mobiles it is in communication with.…”
Section: Noncesmentioning
confidence: 99%
“…and/or a non-hardware source (e.g., the timing and content of events such as mouse movement, keystroke, network traffic, etc.) [20,31].…”
Section: Introductionmentioning
confidence: 99%
“…For example, if an adversary has physical access to a hardware source and/or can control the events of a non-hardware source [20], the adversary may be able to manipulate the data in the entropy pool. Also, in some operating systems such as Linux, random data from the entropy pool may be pre-generated and stored in a buffer for later use.…”
Section: Introductionmentioning
confidence: 99%
“…Their exact position is not known and potentially it can vary in time. Random values can be easily extracted by a standard XOR decimator [10], [11]. In the proposed design the decimator produces one output bit per K D input values q (nT CLK ) (one period T Q ).…”
Section: Basic Principle Of Randomness Extractionmentioning
confidence: 99%
“…Signal x (nT Q ) generally does not fulfill this requirement. One common way to reduce statistical bias is to use a XOR corrector [10], [11]. The simplest XOR corrector takes non-overlapped pairs of bits 5 from the input stream and XORs them to produce an output stream with the half bit-rate of the input stream.…”
Section: Trng Realizationmentioning
confidence: 99%