arXiv · 1106.3574
Cryptographic Hardening of d-Sequences
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.
Explore related subjects
Keep this discovery
Sandhya Rangineni. 2011-06-17. Cryptographic Hardening of d-Sequences. https://arxiv.org/abs/1106.3574
Cite the original work for its findings. Save a collection to share your selection of sources.