Cryptographic Hardening of d-Sequences
Sandhya Rangineni
TL;DR
This paper introduces a method to enhance the randomness of d-sequences through a one-way mapping based on majority bits, supported by experimental evidence, highlighting their distinct behavior from other RNG sequences.
Contribution
It presents a novel approach to improve d-sequences' randomness using majority-based one-way mapping and demonstrates their unique properties compared to other RNGs.
Findings
Improved randomness in d-sequences after applying the method
Distinct behavior of d-sequences from other RNG sequences
Experimental validation supporting the effectiveness of the approach
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Chaos-based Image/Signal Encryption · DNA and Biological Computing