Testing D-Sequences for their Randomness

Abstract

This paper examines the randomness of d-sequences, which are decimal sequences to an arbitrary base. Our motivation is to check their suitability for application to cryptography, spread-spectrum systems and use as pseudorandom sequence.

8 pages, 5 figures

Cited by in corpus (8)

• Binary Random Sequences Obtained From Decimal Sequences
• Analysis of Prime Reciprocal Sequences in Base 10
• Period of the d-Sequence Based Random Number Generator
• Testing Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications
• New Class of Pseudorandom D-sequences to Generate Cryptographic Keys
• A CF-Based Randomness Measure for Sequences
• Partial Cross-Correlation of D-Sequences based CDMA System
• Efficient Key Generation for Dynamic Blom's Scheme