Protection of the Digital Holy Quran Hash Digest by Using Cryptography Algorithms

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.

One of the main elements of the integrated information security system is the subsystem of access’s control to information resources. Recently, more attention is attracted by biometrics as one of the newest information technologies that use the unique characteristics of object identification and verification. Therefore, the question of the protection of information resources from unauthorized administrative actions and access by unauthorized persons or programs to computer data is important.Relevant is the preservation of confidentiality of information processed or stored in computer systems. External influences generally oppose using a variety of software and hardware protection methods. The content of the methods of the protective transformations is that the information stored in the system and is transmitted by communication channels, is turns into a cryptogram — a closed (encrypted) text or graphic image documents. The basis for the encryption is based on two elements: a cryptographic algorithm and key. The security of generic algorithms is determined by the key length. In asymmetric algorithms, the encryption and decryption can be performed with different keys. Such algorithms require significantly more computation time, but do not create problems during key distribution. The most promi-sing data protection systems today are considered an asymmetric system with a public key. The last deca-de a great attention of scientists in the field of information security pay biometric. A biometric system can operate in modes of verification and identification. All of these approaches protect the information easy enough to implement in the time-logic environment, making all the settings required for message transform on the time-logic functions.The possibility of cyclic encoding and the rules for constructing key asymmetric crypto algorithm on the basis of the identification time-logic functions, which contain all the important characteristics of transmitted messages, is analyzed. Available for the formal description of this encoding and the rules of construction keys used in the representation of time-logic functions in the form of polynomials.

Merging the wireless infrastructure network with the wireless mobile ad-hoc networks constitutes hybrid wireless networks (HWNs). Quality of service (QoS) demands are available with the help of HWNs. However, these networks are subjected to many types of attacks because of their open wireless medium. To enhance the security of HWNs, it is necessary to provide secure routing protocols. Several routing protocols have been proposed for HWNs, one of them is the quality of service-oriented distributed (QOD) routing protocol. In this paper, two security mechanisms have been proposed for the QOD protocol. The first mechanism is used to protect transmitted data in the network using asymmetric and symmetric cryptography. The second mechanism has been proposed to enhance the security of the QOD routing protocol using keyed hash message authentication code (HMAC). The second security mechanism assumed that there is a secret key shared between each pair of neighbor nodes. Also, asymmetric cryptography is used to exchange the secret key. The secret key is used to include the message authentication code (MAC) for each message exchanged between the neighbor nodes. A network simulator NS2 is used to simulate our proposed schemes.

Cryptography is a science that studies how to keep data or messages safe when sent, from sender to recipient without interference from third parties. This paper presents a comparison of cryptographic algorithms of simetris keys and asymmetric keys. Cryptographic research related journals are collected and analyzed to find the correct comparison of cryptographic algorithms to implement. The results of this study, namely: symmetric and asymmetric keys have differences in the process of encryption and decryption. There are many cryptographic algorithms that can be applied to symmetric and asymmetric keys, but the selection and use of certain algorithms cannot be said to be forever the best because they depend on the circumstances encountered in developing the applied system.

Security aspects in wireless sensor networks is getting more and more attention in the recent years. Wireless sensor networks are being considered for critical applications where the security issues are a priority. The limited capacities of wireless sensor nodes and the complex algorithms of the security protocols make the subject challenging. Security algorithms are divided into two main families: symmetric and asymmetric algorithms. In this paper we evaluate different symmetric and asymmetric security algorithms in terms of time and energy consumption on one hand and memory usage on another hand.

Wireless Sensor Networks are installed in hostile areas. The security issues in wireless sensor networks are very important. Getting secure links between nodes is a challenging problem in WSNs. They are more vulnerable to security attacks than wired networks. In order to protect the sensitive data in WSN can be protected using secret keys to encrypt the exchanged messages between communicating nodes. Key management is essential for many security services such as confidentiality and authentication. The symmetric or asymmetric key cryptography or Trusted-server schemes are used to solve this problem. Asymmetric key cryptography increases network security but it increases computational, memory, and energy overhead. Symmetric key cryptography provides less security and it is efficient key management scheme. Trusted server schemes use key management server. Because there is usually no trusted infrastructure it is not very suitable for sensor networks. In this paper, we have proposed Mobile Agent (MA) Based Key Distribution (MAKD). In MAKD, Mobile Agents are used for dissemination of public keys and update of shared keys. Each sensor node constructs different symmetric keys with its neighbors, and communication security is achieved by data encryption and mutual authentication with these keys. Simulation results show that MAKD is scalable and with less communication overhead.

In many business sectors sending secure information over public channels has become a challenging task. Data encryption is not the most efficient method to counteract attacks by adversaries. One form of encryption is to use the same key by the sender for encryption as well as the receiver for decryption. World-wide encryption standards such as DES and AES are used in Government and public domains. However symmetric key encryptions are prone to attacks by intruders. Asymmetric key encryption has been proposed in the literature wherein the key to be used to send a message to A is made public and A uses his own private key to decrypt the message. NTRU [23] Labs have used truncated polynomials to generate public and private keys. In this paper we propose matrices as an alternative to truncated polynomials.

In the contemporary era, a vast array of applications employs encryption techniques to ensure the safeguarding and privacy of data. Quantum computers are expected to threaten conventional security methods and two existing approaches, namely Shor's and Grover's algorithms, are expediting the process of breaking both asymmetric and symmetric key classical algorithms. The objective of this article is to explore the possibilities of creating a new polynomial based encryption algorithm that can be both classically and quantum safe. Polynomial reconstruction problem is considered as a nondeterministic polynomial time hard problem (NP hard), and the degree of the polynomials provide the usage of scalable key lengths. The primary contribution of this study is the proposal of a novel encryption and decryption technique that employs polynomials and various polynomial interpolations, specifically designed for optimal performance in the context of a block cipher. This study also explores various root convergence techniques and provides algorithmic insights, working principles and the implementation of these techniques, which can potentially be utilized in the design of a proposed block-cipher symmetric cryptography algorithm. From the implementation, comparison and analysis of Durand Kernal, Laguerre and Aberth Ehrlich methods, it is evident that Laguerre method is performing better than other root finding approaches. The present study introduces a novel approach in the field of polynomial-based cryptography algorithms within the floating-point domain, thereby offering a promising solution for enhancing the security of future communication systems.

Technology is transforming rapidly. Security during data transmission is an increasingly critical and essential factor for the integrity and confidentiality of data in the financial domain, such as e-commerce transactions and bank transactions, etc. We cannot overestimate the importance of encryption/decryption of information in the digital economy. The need to strengthen and secure the digital economy is urgent. Cryptography maintains the security and integrity of data kept on computers and data communicated over the internet using encryption/decryption. A new concept in cryptography named DNA cryptography has attracted the interest of information security professionals. The DNA cryptography method hides data using a DNA sequence, with DNA encryption converting binary data into the DNA sequence. Deoxy Ribonucleic Acid (DNA) is a long polymer strand having nitrogen bases adenine (A), thymine (T), cytosine (C), and guanine (G), which play an important role in plain text encoding and decoding. DNA has high storage capacity, fast processing, and high computation capacity, and is more secure than other cryptography algorithms. DNA cryptography supports both symmetric and asymmetric cryptography. DNA cryptography can encrypt numeric values, English language and unicast. The main aim of this paper is to explain different aspects of DNA cryptography and how it works. We also compare different DNA algorithms/methods proposed in a previous paper, and implement DNA cryptography using one-time pad (OTP) and amino acid sequence using java language. OTP is used for symmetric key generation and the DNA sequence is converted to an amino acid sequence to create confusion.

Asymmetric cryptography is inherently slow because of its associated complex computing, while symmetric cryptography is speedy. However, the latter is suffering from a serious gap which is secure key exchange. To deal with this problem, we suggest an efficient hybrid AES-ECC cryptosystem combining the benefits of the symmetric advanced encryption standard (AES) to speed-up data encryption and the asymmetric elliptic curve cryptography (ECC) to secure the symmetric key session interchange. The proposed hybrid AES-ECC cryptosystem uses a co-design approach and relies on AES-ECC optimisations. We fundamentally mix the matrix multiplication of the AES MixColumns with the S-box allowing for very fast software implementation (on NIOS-II processor). Then, we propose an optimised ECC hardware architecture based on Lopez-Dahab scalar multiplication (on Cyclone IV.E). The implementation results of the proposed cryptosystem afford an interesting trade-off between area, speed, and power and can be used for information and computer security.

Ensuring data security is an essential priority to be put forward once there will be a digital transmission between any two or more targeted audience. Hence, the objective of this paper was to propose a better data security model for a protective information exchange on the internet with steganographic and cryptographic algorithms. Three cryptographic symmetric key encryption algorithm (RC6, Rijndael and TwoFish) and four steganographic carrier object (Image, audio, text and video) were considered. Data obtained show that Rijndael (AES) takes less encipherment and decipherment time compare to RC6 and TwoFish in cryptographic symmetric key encryption algorithm, while image carrier achieves better Peak-Signal-to-Noise Ratio if related to audio, video and text steganography. This research suggests the use of Advanced Encryption Standard and image steganography for efficient information interchange on the internet.

Recently, the issue pertinent to sensor network security is a popular topic. Especially, due to the restriction of energy supplied by battery power of the sensors, symmetric cryptography is one of the suitable choices for the secret communication between sensors, while asymmetric cryptography is not appropriate because of its heavy loading on computation should consume a lot of energy. As a result of using symmetric cryptography, there are numerous research papers focusing on designing efficient key management scheme in sensor networks. PIKE designed by Chan and Perrig is a scheme using peer intermediaries and their pre-installed keys to deliver secret message from one sensor to another. However, they did not consider the case that the sensors are scattered in nonuniform way. Moreover, O(logn) is enough for sensor networks to achieve expander topology while PIKE has O(√n) storage overhead. This article gives generalizations of PIKE to offer more choices for developers under different requirements. The Constant Storage Protocol, abbreviated as CSP, costs constant memory storage and is more suitable for group-based deployment.

This paper analyzes the computer security of systems and importance of the digital signature and hashing message algorithm. The proposed digital signature algorithm gives a new technology for producing effective output of digital signature as a result the signing 1 and verifying of signatures are very fast compared to earlier ones. To improve the security and authentication of sending data, this method uses "Message Digest", "IDEA" and "GOST" 2 algorithms. The new message digest algorithm is to provide high security, to transfer data by combination of digital signature algorithm and symmetric key cryptography algorithm. The new hashing algorithm proposed creates a unique digital fingerprint along with symmetric key encryption generated IDEA and GOST algorithms 3,4 . The receiver used the symmetric key and hashing algorithm to form a signature. If this message digest match with the sender digests the message the content will be decrypted and read by sender.

Sensors are the tiny nodes which are used for getting information from any particular area for some particular situations. These are usually deployed in such places where existence of human may not be possible. These are very small electronic devices having very short amount of resources like memory, power as well as bandwidth. A number of nodes are deployed which are connected with each other and also connected with a base station. While deploying on particular place, there might occur two types of problems; nodes may be in excess or very far from each other. If the nodes are in majority, then the network may be inefficient due to interference and malicious access control collisions. Efficiency of network is the main issue to be resolved at priority bases. While transferring of information from node to node or from node to base station, the least time must be consumed. As much as the network will be efficient, the data will be received and sent easily from node to node or at sink. For making network reliable and secure, cryptographic techniques have been used. A hybrid algorithm has been suggested here using both symmetric and asymmetric cryptographic techniques. A message is divided into two parts containing Meta data and original data. Symmetric cryptography has been implemented on Meta data part while asymmetric cryptography has been applied for the original part of message. This approach will make our network more efficient as well as secure and reliable.

Cryptographic Primitives that Resist Backdooring and Subversion