Evidence map›Paper›PMID 37998237›Full record

ArticleEntropy (Basel, Switzerland)2023

Complexity Reduction in Analyzing Independence between Statistical Randomness Tests Using Mutual Information.

Jorge Augusto Karell-Albo, Carlos Miguel Legón-Pérez, Raisa Socorro-Llanes, Omar Rojas, Guillermo Sosa-Gómez

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Jorge Augusto Karell-AlboInstituto de Criptografía, Facultad de Matemática y Computación, Universidad de la Habana, Habana 10400, Cuba.ORCID 0000-0002-7260-2444
Carlos Miguel Legón-PérezInstituto de Criptografía, Facultad de Matemática y Computación, Universidad de la Habana, Habana 10400, Cuba.ORCID 0000-0002-6104-9671
Raisa Socorro-LlanesFacultad de Ingeniería Informática, Universidad Tecnológica de la Habana José Antonio Echeverría (CUJAE), Habana 19390, Cuba.ORCID 0000-0002-2627-1912
Omar RojasFacultad de Ciencias Económicas y Empresariales, Universidad Panamericana, Álvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico.ORCID 0000-0002-0681-3833
Guillermo Sosa-GómezFacultad de Ciencias Económicas y Empresariales, Universidad Panamericana, Álvaro del Portillo 49, Zapopan 45010, Jalisco, Mexico.ORCID 0000-0001-7793-896X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The advantages of using mutual information to evaluate the correlation between randomness tests have recently been demonstrated. However, it has been pointed out that the high complexity of this method limits its application in batteries with a greater number of tests. The main objective of this work is to reduce the complexity of the method based on mutual information for analyzing the independence between the statistical tests of randomness. The achieved complexity reduction is estimated theoretically and verified experimentally. A variant of the original method is proposed by modifying the step in which the significant values of the mutual information are determined. The correlation between the NIST battery tests was studied, and it was concluded that the modifications to the method do not significantly affect the ability to detect correlations. Due to the efficiency of the newly proposed method, its use is recommended to analyze other batteries of tests.

Indexed as

complexitycryptographymutual informationPRNG

Identifiers

PMID37998237
PMCPMC10670732

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.