paper

Cryptographic Hardening of d-Sequences

arXiv:1106.3574

Abstract

This paper shows how a one-way mapping using majority information on adjacent bits will improve the randomness of d-sequences. Supporting experimental results are presented. It is shown that the behavior of d-sequences is different from that of other RNG sequences.

8 pages, 5 figures, 4 tables

References in corpus (1)

Cryptographic Hardening of d-Sequences · wovepaper