The algorithm for synthesizing the correspondence table correlation of digits and entropy of 256-bit codes of “biometrics-code” neural network converter

A method for accelerated estimation of Shannon entropy for binary sequences, including those generated by the biometrics-code neural network converter, is proposed. The key idea is to establish a functional relationship be-tween the Pearson correlation coefficient of individual bits and the entropy of a 256-bit code, which eliminates the need for a complete enumeration of all bit configurations. At the initial stage, an array of pseudorandom sequences with a length of up to 256 bits is formed, each of which is divided into blocks of fixed length. For each block, the probability of occurrence of all possible combinations and their corresponding values of entropy are calculated, after which, by aggregation, taking into account interblock correlations, the total entropy of the entire sequence is determined. The resulting “correlation coefficient – entropy” pairs form a table in the correlation range from 0 to 1 in increments of 0.1 or 0.01, depending on the selected step parameter before starting the synthesis of the table. Further, the indicated tabular dependence is approximated by a polynomial function, which reduces the computational complexity of the problem from exponential to polynomial. The results of numerical modeling demonstrate that the approximation error does not exceed the accuracy of the direct Shannon method while reducing time costs. The synthesized table is based solely on the statistical characteristics of the sequence, which provides the possibility of universal application for codes generated by various biometric converters. It is advisable to integrate the presented approach into trusted low-bit microcontrollers and other devices with limited resources, as well as into Russian high-security operational systems (for example, Astra Linux) for an operational and reliable assessment of the randomness of the output sequence of “biometrics-code” neural network converter.

Authors

Institutions

Publication Details

Journal
VESTNIK OF ASTRAKHAN STATE TECHNICAL UNIVERSITY SERIES MANAGEMENT COMPUTER SCIENCE AND INFORMATICS
Published
2026-02-18
DOI
https://doi.org/10.24143/2072-9502-2026-1-62-71
Primary Topic
Advanced Signal Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The algorithm for synthesizing the correspondence table correlation of digits and entropy of 256-bit codes of “biometrics-code” neural network converter

Nikolay Andreevich Postnikov
VESTNIK OF ASTRAKHAN STATE TECHNICAL UNIVERSITY SERIES MANAGEMENT COMPUTER SCIENCE AND INFORMATICS
Advanced Signal Processing Techniques
article

The algorithm for synthesizing the correspondence table correlation of digits and entropy of 256-bit codes of “biometrics-code” neural network converter

Nikolay Andreevich Postnikov
article en

Abstract

A method for accelerated estimation of Shannon entropy for binary sequences, including those generated by the biometrics-code neural network converter, is proposed. The key idea is to establish a functional relationship be-tween the Pearson correlation coefficient of individual bits and the entropy of a 256-bit code, which eliminates the need for a complete enumeration of all bit configurations. At the initial stage, an array of pseudorandom sequences with a length of up to 256 bits is formed, each of which is divided into blocks of fixed length. For each block, the probability of occurrence of all possible combinations and their corresponding values of entropy are calculated, after which, by aggregation, taking into account interblock correlations, the total entropy of the entire sequence is determined. The resulting “correlation coefficient – entropy” pairs form a table in the correlation range from 0 to 1 in increments of 0.1 or 0.01, depending on the selected step parameter before starting the synthesis of the table. Further, the indicated tabular dependence is approximated by a polynomial function, which reduces the computational complexity of the problem from exponential to polynomial. The results of numerical modeling demonstrate that the approximation error does not exceed the accuracy of the direct Shannon method while reducing time costs. The synthesized table is based solely on the statistical characteristics of the sequence, which provides the possibility of universal application for codes generated by various biometric converters. It is advisable to integrate the presented approach into trusted low-bit microcontrollers and other devices with limited resources, as well as into Russian high-security operational systems (for example, Astra Linux) for an operational and reliable assessment of the randomness of the output sequence of “biometrics-code” neural network converter.

VESTNIK OF ASTRAKHAN STATE TECHNICAL UNIVERSITY SERIES MANAGEMENT COMPUTER SCIENCE AND INFORMATICSVol. 2026(1)
Penza Electrotechnical Research Institute (Russia) (RU)
Openalex Percentile: Top 29%
Advanced Signal Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.