Cryptographic constructions on the basis of functions of multivalued logic

2020 ◽  
Author(s):  
Artem Sokolov ◽  
Oleg Zhdanov

Symmetric encryption algorithms have been successfully used to protect information during transmission on an open channel. The classical approach to the synthesis of modern cryptographic algorithms and cryptographic primitives on which they are based, is the use of mathematical apparatus of Boolean functions. The authors demonstrate that the use to solve this problem of functions of multivalued logic (FML) allows to largely improve the durability of the cryptographic algorithms and to extend the used algebraic structures. On the other hand, the study of functions of multivalued logic in cryptography leads to a better understanding of the principles of cryptographic primitives and the emergence of new methods of describing cryptographic constructions. In the monograph the results of theoretical and experimental studies of the properties of the FML, the presented algorithms for generating high-quality S-blocks for the symmetric encryption algorithms, as well as full-working samples of the cryptographic algorithms ready for practical implementation. For students and teachers and all those interested in issues of information security.

2014 ◽  
Vol 60 (1) ◽  
pp. 25-45 ◽  
Author(s):  
Dmytro Kaidalov ◽  
Roman Oliynykov ◽  
Oleksandr Kazymyrov

Abstract Symmetric block ciphers are the most widely used cryptographic primitives. In addition to providing privacy, block ciphers are used as basic components in the construction of hash functions, message authentication codes, pseudorandom number generators, as a part of various cryptographic protocols, etc. Nowadays the most popular block cipher is AES (Advanced Encryption Standard). It is used as a standard of symmetric encryption in many countries. Several years ago it was found a theoretical attack exploiting the AES key expansion algorithm that allows reducing significantly the complexity comparing to the brute force attack. This article presents an advanced method of finding the number of active substitutions that helps to estimate the security of encryption algorithms against related-key attacks. The method was applied to a prospective block cipher, which is a candidate for the Ukrainian standard


Author(s):  
V. Korolyov ◽  
M. Ogurtsov ◽  
A. Khodzinsky

Introduction. Widespread use of unmanned aerial vehicles in the civilian and military spheres requires the development of new algorithms for identification friend or foe of targets, as used in the Armed Forces of Ukraine (AFU) devices of the "Parol" system are designed to service approximately 110 objects military equipment. AFU automation systems allow the use of additional sources of information about various objects from civil or special data transmission networks, which can be the basis for building a networked multi-level system of state recognition. Predictions of the development of quantum computers foresee the possibility of breaking modern algorithms for information security in polynomial time in the next 5-10 years, which requires the development and implementation of new encryption algorithms and revision of modern parameters. The purpose of the article is to develop a new algorithm for state recognition of objects, which can be scaled to process the required number of manned and unmanned aerial vehicles. Potential threats to classical cryptographic protection algorithms for data networks, which will result in the execution of algorithms such as Grover and Shore on quantum computers, were also discussed. Results. The article proposes a new multilevel algorithm of state recognition based on modern cryptographic methods of information protection, which allows to perform reliable automated identification of objects, scale systems using data on potential targets from other sources through secure special networks. Grover's search algorithm does not give a strong increase in key search performance for symmetric encryption algorithms, so there is no need to increase the key lengths for this type of information security algorithms. Post-quantum asymmetric encryption algorithms require additional study and comprehensive testing of information security or increasing the key lengths of cryptographic algorithms, which corresponds to the number of qubits, i.e. more than twice. The most promising is the family of asymmetric post-quantum cryptographic algorithms based on supersingular isogenic elliptic curves. Conclusions. The developed algorithm of identification friend or foe of objects is more secure compared to existing algorithms and is focused on the use of modern on-board computers and programmable radio modems. Shore's algorithm and the like will be a significant threat to modern asymmetric cryptography algorithms when the number of qubits of quantum computers exceeds the number of bits in public keys more than twice. Keywords: identification friend or foe, symmetric encryption, asymmetric cryptography, quantum computer, post-quantum cryptography.


2021 ◽  
Vol 247 ◽  
pp. 01030
Author(s):  
Mafiiat Rakhmanova ◽  
Amiiat Demirova ◽  
Magomed Akhmedov ◽  
Faina Azimova ◽  
Irada Gadzhibekova ◽  
...  

New technical solutions improving the process of thermal sterilization of canned products through the use of multilevel high-temperature modes and heat recovery have been considered and proposed. The essence of the developed method lies in the fact that the heat released by cooling cans with the product that has undergone thermal sterilization is used to heat other cans with the product queued for sterilization. In this mode of heat treatment, except in the last stage, the heat emitted by cooled cans that have already undergone heat treatment is used to heat up the canned food. Hence, the use of the principle of heat recovery by cooling canned products in the baths where others are simultaneously heated provides a significant saving of heat energy and water. Depending on the temperature parameters at different stages of the heat treatment, the heat recovery rate can reach up to 90%. The method also provides savings on cooling water. For the practical implementation of the developed method, the design of the device for multilevel high-temperature thermal sterilization of canned food with heat recovery has been developed. On the basis of experimental studies, new, multilevel high-temperature modes of apple compote sterilization have been developed.


2022 ◽  
Vol 2 (14) ◽  
pp. 55-65
Author(s):  
Hoang Dinh Linh ◽  
Do Dai Chi ◽  
Nguyen Tuan Anh ◽  
Le Thao Uyen

Abstract—Random numbers play a very important role in cryptography. More precisely, almost cryptographic primitives are ensured their security based on random values such as random key, nonces, salts... Therefore, the assessment of randomness according to statistical tests is really essential for measuring the security of cryptographic algorithms. In this paper, we focus on so far randomness tests based on runs in the literature. First, we have proved in detail that the expected number of gaps (or blocks) of length  in a random sequence of length  is . Secondly, we have evaluated correlation of some tests based on runs so far using Pearson coefficient method [5, 6] and Fail-Fail ratio one [7, 8]. Surprisingly, the Pearson coefficient method do not show any strong linear correlation of these runs-based tests but the Fail-Fail ratio do. Then, we have considered the sensitivity of these runs tests with some basic transformations. Finally, we have proposed some new runs tests based on the sensitivity results and applied evaluations to some random sources. Tóm tắt—Số ngẫu nhiên đóng một vai trò quan trọng trong mật mã. Cụ thể, độ an toàn của hầu hết các nguyên thủy mật mã đều được đảm bảo dựa trên các giá trị ngẫu nhiên như khóa, nonce, salt… Do đó, việc đánh giá tính ngẫu nhiên dựa trên các kiểm tra thống kê là thực sự cần thiết để đo độ an toàn cho các thuật toán mật mã. Trong bài báo này, chúng tôi tập trung vào các kiểm tra ngẫu nhiên dựa vào run trong các tài liệu. Đầu tiên, chúng tôi chứng minh chi tiết rằng kỳ vọng số các gap (khối) độ dài  trong một chuỗi ngẫu nhiên độ dài  là . Sau đó, chúng tôi đánh giá mối tương quan của một số kiểm tra dựa vào run bằng phương pháp hệ số Pearson [5, 6] và tỷ số Fail-Fail  [7, 8]. Đáng ngạc nhiên là phương pháp hệ số Pearson không cho thấy bất kỳ mối tương quan tuyến tính mạnh nào của các kiểm tra dựa vào run, trong khi đó tỷ số Fail-Fail lại chỉ ra. Tiếp theo, chúng tôi xem xét độ nhạy của các kiểm tra run này với một số phép biến đổi cơ bản. Cuối cùng, chúng tôi đề xuất một số kiểm tra run mới dựa trên các kết quả độ nhạy và đánh giá áp dụng chúng cho một số nguồn ngẫu nhiên.


2021 ◽  
Vol 50 (4) ◽  
pp. 786-807
Author(s):  
Alen Salkanovic ◽  
Sandi Ljubic ◽  
Ljubisa Stankovic ◽  
Jonatan Lerga

This paper evaluates the performances of numerous encryption algorithms on mobile devices running the Android operating system. The primary objective of our research was to measure and compare the relative performances of tested algorithm implementations (Data Encryption Standard (DES), 3DES, Advanced Encryption Standard (AES), ChaCha20, Blowfish, and Rivest Cipher 4 (RC4)) on the Android platform. The algorithms were compared in terms of CPU utilization by measuring the time required to encrypt and decrypt variable size text files. Besides evaluating the six common symmetric encryption ciphers, a comparison has been conducted for several Password-Based Encryption (PBE) algorithms. Diverse cipher transformations were evaluated for each algorithm by utilizing various feedback modes and padding schemes. Two smartphone devices were used for testing, with different versions of the Android operating system and hardware specifications. The summarized performance outcomes for various cipher transformations are presented to demonstrate the effectiveness of each algorithm.


2020 ◽  
Vol 8 (6) ◽  
pp. 5759-5764

Given the current use of the Internet, The most important thing is to provide security to the user's information. Many encryption algorithms already exist for this purpose. Here we discussed a new process called Mahaviracharya Encryption Standard. MES is a symmetric encryption algorithm. Here, this algorithm is cryptanalyzed, and compared with blowfish algorithm. MES algorithm can be used instead off algorithms like AES, Blowfish etc.


2021 ◽  
Vol 16 (1) ◽  
pp. 1-13
Author(s):  
Yu Zhou ◽  
Jianyong Hu ◽  
Xudong Miao ◽  
Yu Han ◽  
Fuzhong Zhang

Abstract The notion of the confusion coefficient is a property that attempts to characterize confusion property of cryptographic algorithms against differential power analysis. In this article, we establish a relationship between the confusion coefficient and the autocorrelation function for any Boolean function and give a tight upper bound and a tight lower bound on the confusion coefficient for any (balanced) Boolean function. We also deduce some deep relationships between the sum-of-squares of the confusion coefficient and other cryptographic indicators (the sum-of-squares indicator, hamming weight, algebraic immunity and correlation immunity), respectively. Moreover, we obtain some trade-offs among the sum-of-squares of the confusion coefficient, the signal-to-noise ratio and the redefined transparency order for a Boolean function.


Author(s):  
V.A. Altunin ◽  
K.V. Altunin ◽  
M.R. Abdullin ◽  
M.R. Chigarev ◽  
I.N. Aliev ◽  
...  

Relying on the review and analysis of scientific and technical literature, as well as the results of experimental studies, we developed new methods for calculating thermal processes occurring in gaseous methane during its natural convection, under the influence of electrostatic fields. In this study we show methods for calculating and determining the coefficients of heat transfer to gaseous methane under the influence of electric wind, as well as methods for calculating and determining the effect of electrostatic fields on the negative process of sedimentation on a heated experimental working plate in the volume of gaseous methane. A general method has been developed for the effective and safe application of electrostatic fields in gaseous methane, which must be carried out in the calculations, design, creation, and operation of new engines, power plants, and techno systems for single and reusable ground, air, aerospace and space-based aircraft.


2012 ◽  
Vol 303 (10) ◽  
pp. L861-L869 ◽  
Author(s):  
Mohammad A. Khan ◽  
Gundeep Dhillon ◽  
Xinguo Jiang ◽  
Yu-Chun Lin ◽  
Mark R. Nicolls

A dual circulation, supplied by bronchial and pulmonary artery-derived vessels, normally perfuses the airways from the trachea to the terminal bronchioles. This vascular system has been highly conserved through mammalian evolution and is disrupted at the time of lung transplantation. In most transplant centers, this circulation is not restored. The Papworth Hospital Autopsy study has revealed that an additional attrition of periairway vessels is associated with the development of chronic rejection, otherwise known as the bronchiolitis obliterans syndrome (BOS). Experimental studies subsequently demonstrated that airway vessels are subject to alloimmune injury and that the loss of a functional microvascular system identifies allografts that cannot be rescued with immunosuppressive therapy. Therefore, surgical and medical strategies, which preserve the functionality of the existent vasculature in lung transplant patients, may conceivably limit the incidence of BOS. Given these unique anatomic and physiological considerations, there is an emerging rationale to better understand the perfusion and oxygenation status of airways in transplanted lungs. This article describes novel methodologies, some newly developed by our group, for assessing airway tissue oxygenation and perfusion in experimental and clinical transplantation.


Sign in / Sign up

Export Citation Format

Share Document