Optimization of Acoustic Entropy Source for Random Sequence Generation Using an Improved Grey Wolf Algorithm
Bibliographic record
Abstract
The functionality of cryptographic systems necessitates unpredictable, high-quality random numbers. High-quality random numbers must possess unpredictability, non-reproducibility, and strong statistical properties. To achieve these qualities, True Random Number Generators (TRNG) are employed. The randomness quality of TRNG-derived sources depends on the entropy source used. Physical noise sources, ring oscillators, metastable, acoustic sources, and chaotic attractors are commonly used as entropy sources. In recent years, the use of acoustic signals as entropy sources has attracted attention. However, the noise in the signals affects the bit sequence to be generated. In addition, the threshold and sampling interval applied to the frequency values obtained from the signals also determine the quality of the bit sequence to be produced. Choosing the most appropriate values for the entropy source, randomness and unpredictability of these values are important for the bit sequence to have good statistical properties and to be used in strong cryptographic applications. In this paper, a swarm intelligence-based approach is proposed to determine the optimal threshold and sampling interval by exploiting the power of randomness and unpredictability such as random initialization of swarm intelligence algorithms and obtaining different optimal solutions in each run. In the proposed approach, a bit sequence is generated by applying the values determined by the Improved Grey Wolf Optimization algorithm on the data taken from the MUSDB18 dataset as an entropy source. The generated bit sequences have been shown to be usable as initial value, seed value or additional input for cryptographic key and random number generators by obtaining a p-value greater than 0.01 from the National Institute of Standards and Technology (NIST) test, statistical complexity test (SCM) and autocorrelation test with results close to 0 by obtaining 0.013, 0.074 respectively. Furthermore, to show that the obtained bit sequences can be used as cryptographic keys in the encryption system, we perform encryption on two different images and present histogram and differential attack (UACI, NPCR) test results.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".