English

Cryptographic Hardening of d-Sequences

Cryptography and Security 2011-06-21 v1

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.

Cite

@article{arxiv.1106.3574,
  title  = {Cryptographic Hardening of d-Sequences},
  author = {Sandhya Rangineni},
  journal= {arXiv preprint arXiv:1106.3574},
  year   = {2011}
}

Comments

8 pages, 5 figures, 4 tables

R2 v1 2026-06-21T18:24:11.377Z