Secure Hash Function Constructing for Future Communication Systems and Networks

Gnatyuk, Sergiy; Kinzeryavyy, Vasyl; Kyrychenko, Karina; Yubuzova, Khalicha; Aleksander, Marek; Одарченко, Роман

doi:10.1007/978-3-030-12082-5_51

Cited by 16 publications

(12 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, significant progress has been made in the theory of non-binary codes. The new ternary and quaternary codes [30][31][32][33][34] are described. Attractive is the direction associated with the codes above the rings of deductions [35,36].…”

Section: Discussion Of Results Of Reducing the Signal Distance While Increasing The Operational Efficiency Of The Code Construct Of A Mulmentioning

confidence: 99%

Analyzing the code structures of multidimensional signals for a continuous information transmission channel

Беркман

Turovsky

Kyrpach

et al. 2021

EEJET

View full text Add to dashboard Cite

One of the directions to improve the efficiency of modern telecommunication systems is the transition to the use of multidimensional signals for continuous channels of information transmission. As a result of studies carried out in recent years, it has been established that it is possible to ensure high quality of information transmission in continuous channels by combining demodulation and decoding operations into a single procedure that involves the construction of a code construct for a multidimensional signal. This paper considers issues related to estimating the possibility to improve the efficiency of continuous information transmission channel by changing the signal distance of the code structure. It has been established that the code structures of such types as a hierarchical code construct of signals, a hierarchical code construct of signals with Euclidean metric, a reversible code construct of signals, a reversible code construct of signals with Euclidean metric have the potential, when used, to increase the speed of information transmission along a continuous channel. With a signal distance reduced by 10 percent or larger, it could increase by two times or faster. The estimation of the effect of reducing a signal distance on the efficiency of certain types of code structures was carried out. It has been established that the hierarchical reversible code construct, compared to the hierarchical code construct, provides a win of up to two or more times in the speed of information transmission with a halved signal distance. Implementing the modulation procedure has no fundamental difficulties, on the condition that for each code of the code construct the encoding procedure is known when using binary codes. The results reported here make it possible to build an acceptably complex demodulation procedure according to the specified types of code structures

show abstract

Section: Discussion Of Results Of Reducing the Signal Distance While Increasing The Operational Efficiency Of The Code Construct Of A Mulmentioning

confidence: 99%

Analyzing the code structures of multidimensional signals for a continuous information transmission channel

Беркман

Turovsky

Kyrpach

et al. 2021

EEJET

View full text Add to dashboard Cite

show abstract

“…The average value (6) for all 1 ( , ... , )  r r k k K is called the average probability of differential parameter  (EDP) and it can be defined by following formula [13]:…”

Section: Problem Statementmentioning

confidence: 99%

Studies on Practical Cryptographic Security Analysis for Block Ciphers With Random Substitutions

Akhmetov¹,

Gnatyuk²,

Kinzeryavyy³

et al. 2020

IJC

Self Cite

View full text Add to dashboard Cite

In up-to-date information and communication systems (ICS) cryptography is used for ensuring data confidentiality. The symmetric block ciphers (BC) are implemented in different ICS including critical applications. Today theory of analysis and security verification of BC with fixed substitution nodes against linear and differential cryptanalysis (LDC) is developed. There are also BC with substitution nodes defined by round keys. Random substitution nodes improve security of ciphers and complicate its cryptanalysis. But through it all, quantitative assessment is an actual and not simple task as well as the derivation of formulas for practical security verification for BC with random substitution nodes against LDC. In this paper analytical upper bounds of parameters characterized practical security of BC with random substitution nodes against LDC were given. These assessments generalize known analogs on BC with random substitution nodes and give a possibility to verify security improving against LDC. By using the example of BC Kalyna-128, it was shown that the use of random substitution nodes allows improving upper bounds of linear and differential parameters average probabilities in 246 and 290 times respectively. The study is novel as it is one of the few in the cryptology field to calculate analytical upper bounds of BC practical security against LDC methods as well as to show and prove that using random substitutions allows improving upper bounds of linear and differential parameters. The security analysis using quantitative parameters gives possibility to evaluate various BCs or other cryptographic algorithms and their ability to provide necessary and sufficient security level in ICS. A future research study can be directed on improving analytical upper bounds for analyzed LDC in context to practical security against LDC, as well as practical cryptographic security assessment for other BC with random substitutions against LDC and other cryptanalysis methods including quantum cryptanalysis (Shor, Grover, Deutsch-Jozsa algorithms).

show abstract

“…Therefore, the nearest neighbor query for high-dimensional data often uses a product quantization strategy, which is mapped to a low-dimensional subspace for approximate nearest neighbor retrieval. With its advantages in computing speed and storage efficiency, the hash method stands out among many Approximate Nearest Neighbor (ANN) [15], [16] retrieval methods, and is widely used in computer vision [17]- [20] and data security [21], [22] fields. With the in-depth study of deep learning, the performance of the deep hash method in computer vision is staggering, which not only reflected in the convenience of sample feature extraction, but also in performance improvement [23].…”

Section: Introductionmentioning

confidence: 99%

Angular Quantization Online Hashing for Image Retrieval

Fang

Liu

2022

IEEE Access

View full text Add to dashboard Cite

Online hash method with fast search mechanism and compact index structure plays a pivotal role. The inner product between label data has become one of the important means to measure the similarity between existing data and new data streams in online hashing methods. However, due to its discrete attributes and semantic gap, it often leads to a large amount of information loss. In this article, we propose a new method called Angular Quantization Online Hashing (AQOH) to focus on learning compact binary codes with the help of cosine distance. Specifically, we propose an online hashing method for angular quantization, by minimizing the quantization error between the cosine similarity calculated from the original data and the generated binary code between the existing data and the new data stream. Further, within this framework, two effective algorithms to complete the optimization of the objective function to be designed, including continuous and discrete methods, respectively. Extensive experiments on various benchmark databases for online retrieval verify that our method outperforms many state-of-the art learning to hash methods.

show abstract

Secure Hash Function Constructing for Future Communication Systems and Networks

Cited by 16 publications

References 7 publications

Analyzing the code structures of multidimensional signals for a continuous information transmission channel

Analyzing the code structures of multidimensional signals for a continuous information transmission channel

Studies on Practical Cryptographic Security Analysis for Block Ciphers With Random Substitutions

Angular Quantization Online Hashing for Image Retrieval

Contact Info

Product

Resources

About