
Khalimov GennadyKharkiv National University of Radio Electronics · Department of Information Technologies Security (ITS)
Khalimov Gennady
Doctor of Engineering
About
30
Publications
445
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
81
Citations
Introduction
Khalimov Gennady currently works at the Department of Information Technologies Security (ITS), Kharkiv National University of Radio Electronics. Khalimov does research in Applied Mathematics and Computer Security and Reliability. Their most recent publication is 'ESTIMATION OF FERMA CURVES PARAMETERS FOR UNIVERSAL HASHING OF NUMBER SOLUTION FOR HURVITZ EQUATION IN THE FINITE FIELD'.
Publications
Publications (30)
The paper explores a novel cryptosystem for digital signatures based on linear equa-tions for logarithmic signatures. A logarithmic signature serves as a fundamental cryptographic primitive, characterized by properties such as nonlinearity, non-commutability, unidirectionality, and key-dependent factorability. The proposed cryptosystem ensures the...
Asymmetric cryptography relies on the principle of ease of calculation and complexity of one-sided functions’ inversion. These functions can be easily implemented, but inverting them is computationally difficult. In this context, NP-complete problems are ideal candidates for the role of such functions in asymmetric cryptography, since generating th...
We develop a new PT-symmetric approach for mapping three pure qubit states, implement it by the dilation method, and demonstrate it with a superconducting quantum processor provided by the IBM Quantum Experience. We derive exact formulas for the population of the post-selected PT-symmetric subspace and show consistency with the Hermitian case, cons...
This article presents a new implementation of encryption based on MST, focused on generalized Suzuki 2-groups. The well-known MST cryptosystem, based on Suzuki groups, is constructed using a logarithmic signature at the center of the group, leading to a large array of logarithmic signatures. The proposed encryption is based on multi-parameter nonco...
This article is a part of a research endeavor focused on creating a quantum-resistant cryptosystem for secure encryption and decryption. Our approach employs a challenging word problem while emphasizing cost-effective implementation. Previous research has involved the development of encryption schemes based on high-order groups, offering potential...
This article presents a new encryption method based on the group of automorphisms of Suzuki's functional field, which enhances the security level of the existing MST3 cryptosystem. This approach is a response to the progress in developing powerful quantum computers, which can threaten the security of many public-key encryption systems, particularly...
The article proposes a method for constructing a three-parameter encryption scheme based on Hermitian groups, which improves the security parameters of the existing MST3 cryptosystem. The challenge of improving existing approaches to building cryptosystems is driven by successes in building a quantum computer with sufficient computing power to rend...
To realize the computational advantages of quantum mechanics, it is necessary to be able to effectively perform quantum state tomography, and Bayesian methods provide significant opportunities in this regard, being applicable in the uncertainty regimes, where the local approaches based on Cramer-Rao bound become ill-defined. PT-symmetric quantum me...
We present a novel $\mathcal{PT}$-symmetric approach for discriminating three pure qubit states and its implementation by the dilation method. Our approach based on the dilation method manipulating the Hilbert space of the system by two-staged $\mathcal{PT}$-symmetric evolution expedites the three-state discrimination process at the cost of introdu...
This article describes a new implementation of MST-based encryption for generalized Suzuki 2-groups. The well-known MST cryptosystem based on Suzuki groups is built on a logarithmic signature at the center of the group, resulting in a large array of logarithmic signatures. An encryption scheme based on multiparameter non-commutative groups is propo...
This article describes a new implementation of MST-based encryption for generalized Suzuki 2-groups. The well-known MST cryptosystem based on Suzuki groups is built on a logarithmic signature at the center of the group, resulting in a large array of logarithmic signatures. An encryption scheme based on multiparameter non-commutative groups is propo...
Hash-based signatures are a wide class of post-quantum cryptographic algorithms, their security is based on the complexity of collision and preimage search problems for cryptographic hash functions. The main advantages of this class are post-quantization, easy modification and a well-researched mathematical base. The disadvantages are large sizes o...
Implementations for cryptosystems of finite groups based on the logarithmic signature and covering are considered. A logarithmic signature is exemplified by a permutation group with the asymmetry of encryption and decryption algorithms. Decryption of the improved cryptosystem MST3 in Suzuki 2-group with the order of the group q ² is given. The Suzu...
Implementations for cryptosystems of finite groups based on logarithmic signature and covering are considered. A logarithmic signature is exemplified by a permutation group with the asymmetry of encryption and decryption algorithms. Description of the improved cryptosystem MST3 in Suzuki 2-group with the order of the group q2 is given. The Suzuki 2...
The author presents the results of estimation of Hurvitz equation solutions number in finite field and practical algorithm of solutions finding. Key words: Hurvitz curve.
The problem of computer simulation of holographic recognition systems is considered. An analysis is made of a number theory transform method for image processing where the brightness relief is represented by a matrix of binary numbers. The number theory convolution transformation method saves computer time and storage capacity in this case over fas...