#### Filter Results:

#### Publication Year

1993

2015

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

It is shown that the amount of true randomness produced by the recently introduced Galois and Fibonacci ring oscillators can be evaluated experimentally by restarting the oscillators from the same initial conditions and by examining the time evolution of the standard deviation of the oscillating signals. The restart approach is also applied to classical… (More)

- Markus Dichtl
- FSE
- 1997

- Markus Dichtl
- FSE
- 2007

Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing random numbers described in [MGK05] is ineffective and very easy to attack. We also suggest new algorithms which extract considerably more entropy from their input than the known… (More)

In the course of the evaluation of the stream cipher SOBER-t32 submitted to NESSIE, a correlation between initial states has been found for related keys. With high probability some sums of bits of the initial state after key loading do not change their value when a bit of the key is inverted. This holds also for the loading of frame keys. It is shown that… (More)

In their paper " A Provably Secure True Random Number Generator with Built-in Tolerance to Active Attacks " , B. Sunar, W. Mar-tin, and D. Stinson propose a design for a true random number generator. Using SPICE simulation we study the behaviour of their random number generator and show that practical implementations result in a too high frequency signal to… (More)