Кодування як засіб захисту інформації у системах контролю доступу з використанням логіко-часових функцій у формі поліномів і біометричних даних суб’єктів

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.

Rivest, Shamir, and Adleman (RSA) is one of the most important types of asymmetric cryptography. In RSA, the key size is larger compared to algorithms in cryptography. In this concept, keys are generated with any two prime numbers. An unauthorized person can easily obtain the keys using a Greatest Common Delvisor (GCD) attack. This is one of the main disadvantages of RSA cryptography. Elliptic Curve Cryptography (ECC) is also an asymmetric cryptography with a small key size. The proposed work aims to overcome the disadvantage of GCD attack in RSA. An RSA private and public key can be combined with an ECC private and public key using Exclusive OR(XOR) to generate a new hybrid private and public key. RSA encryption can be done using a new hybrid public key. RSA decryption can be done using a new hybrid private key. The advantage of the proposed work is to create three key levels for cryptography to prevent GCD attack in RSA. The key strength is higher compared to simple RSA key generation.

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.

An asymmetric encryption method in 4f system based on interference is proposed in this paper. The original image is transformed into two white stationary noise images, and the decryption keys are designed to be different from the encryption keys to realize asymmetric encryption. The decryption process is implemented in a 4f system of image addition with grating. This method has very high security as the asymmetric cryptosystem encryption system but also can be easy implemented in optical system. Besides, holographic plate or photorefractive crystal is not necessary in the encryption process. The simulation results prove the feasibility and security of this method.

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.

Secure the communication over network is an important task. Security of Vehicular Ad hoc Networks (VANET) is prime concern due to the numbers of attacker’s existence. We can protect information by using different cryptography methods. The Rivest–Shamir–Adleman (RSA) is one of the asymmetric key cryptography systems to protect information. In asymmetric key cryptography system from the generated key pair, one key is used for information to encrypt and the another key is used for information to decrypt. In RSA, the value of n is computed through the multiplication of two prime numbers p and q. If the factors of n can be found by the intruder using brute force attack, therefore, the security level will reduce. In this paper, we proposed a modified RSA algorithm called MRSA with three prime numbers j, k, and l for VANETs to increase the level of security in vehicular communication. RSA algorithm is with one more prime number, i.e., three prime numbers are used rather than two prime numbers, for increasing the brute force attack time. The lifetime of a message in VANETs may be less. Therefore, MRSA may provide us better result by enhancing the level of security with small key size. The experimental results and analyses are shown for both the RSA and MRSA cryptography algorithms.

Information security is today’s everybody’s concern. Technology keeps on increasing however the issue of information theft are getting higher. The confidentiality, integrity and availability of information are being compromised and always at risk though information security are keeps on improving. This study aimed to build an information security using a text-based platform to store the data and preserved its confidentiality, integrity and availability. The study will focus on the security of information and its confidentiality, integrity, and availability. An information system was developed using Java. Once the user started to process the data, the system will automatically create a text file where data inputted from the system will be are stored. The system will generate text-based formats per user. Another text file pass dot(.) txt whew passwords are stored. The data or information are stored in different text files. The transaction data and passwords are encypted using asymmetric algorithms. Each user account should have a private key to be able to access the data. Once the user is log in to the system, user will use a public key to able to access the data. Moreover, the text files where the passwords are kept and the text files where data are stored will be encrypted using symmetric algorithm which uses a public key to all users. The researcher used descriptive research design in the project. Descriptive research is being used by the proponents to describe the assessment of the respondents in the security of an information.

The majority of imaging techniques use symmetric and asymmetric cryptography algorithms to encrypt digital media. Most of the research works contributed in the literature focus primarily on the Advanced Encryption Standard (AES) algorithm for encryption and decryption. This paper propose an analysis for performing image encryption and decryption by hybridization of Elliptic Curve Cryptography (ECC) with Hill Cipher (HC), ECC with Advanced Encryption Standard (AES) and ElGamal with Double Playfair Cipher (DPC). This analysis is based on the following parameters: (i) Encryption and decryption time, (ii) entropy of encrypted image, (iii) loss in intensity of the decrypted image, (iv) Peak Signal to Noise Ratio (PSNR), (v) Number of Pixels Change Rate (NPCR), and (vi) Unified Average Changing Intensity (UACI). The hybrid process involves the speed and ease of implementation from symmetric algorithms, as well as improved security from asymmetric algorithms. ECC and ElGamal cryptosystems provide asymmetric key cryptography, while HC, AES, and DPC are symmetric key algorithms. ECC with AES are perfect for remote or private communications with smaller image sizes based on the amount of time needed for encryption and decryption. The metric measurement with test cases finds that ECC and HC have a good overall solution for image encryption.

PurposeThe privacy of the information is a major challenge in the communication process. In the present modern generation, the cryptography plays a vital role in providing security for data, such as text, images and video while transmitting from source to destination through internet or intranet. The Rivest-Shamir-Adleman (RSA) is an asymmetric key cryptographic system, where the security of the method works on the strength of the key.Design/methodology/approachIn an asymmetric key crypto system, a pair of keys is generated one public key for encryption and one private key for decryption. The major challenge of implementing the RSA is the power function which becomes tedious and time consuming as the exponential value increases. The Chinese remainder theorem proves to be the best for data encryption when it comes to execution time of the algorithm. The proposed novel RSA algorithm with lookup table (LUT) is an extension to the Chinese remainder algorithm, which works better for image and video in terms of time complexity.FindingsThis paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods.Originality/valueThis paper presents a LUT approach for implementing the RSA with a minimal processing time. The proposed algorithm was compared with the standard algorithms like, Chinese remainder theorem, binary approach and squared multiplication approach. As the size of the exponent value increases, the proposed method shows better performance compared to other standard methods.

Security of sensitive information at the time of transmission over public channels is one of the critical issues in digital society. The DNA-based cryptography technique is a new paradigm in the cryptography field that is used to protect data during transmission. In this paper we introduce the asymmetric DNA cryptography technique for encrypting and decrypting plain-texts. This technique is based on the concept of data dependency, dynamic encoding and asymmetric cryptosystem (i.e. RSA algorithm). The asymmetric cryptosystem is used solely to initiate the encryption and decryption processes that are completely conducted using DNA computing. The basic idea is to create a dynamic DNA table based on the plaintext, using multi-level security, data dependency and generating 14 dynamic round keys. The proposed technique is implemented using the JAVA platform and its efficiency is examined in terms of avalanche property. The evaluation process proves that the proposed technique outperforms the RSA algorithm in terms of avalanche property.

Network security is an important aspect of information sharing. Attempts have been made to remove various insecurities over internet. For this, many technological implementations and security policies have been developed. The amount of data, transferred, is not a factor. The basic factor is, how much security, the channel provides while transmitting data. Cryptography is one such technique, which allows secure data transmission without losing its confidentiality and integrity. Based on the key distribution, cryptography is further classified into two major types-Symmetric Key Cryptography and Asymmetric Key Cryptography. In this paper, we have surveyed the traditional algorithms, along with the proposed algorithms based on their pros and cons, related to Symmetric and Asymmetric Key Cryptography. We have also compared the importance of both these cryptographic techniques. The proposed algorithms proved to be highly efficient in their respective grounds but there are certain areas that remained open, related to these algorithms, and have not yet been thoroughly discussed. This paper also presents an appropriate future scope related to these open fields.

SummaryObjects/tags are generally passes through multiple readers before achieving the final destination within the IoT network. Hence, object identification is a significant issue as some bogus objects may take part for malicious access. Considering this situation, RFID can be used for unique identification and validation of IoT objects. However, it recognizes many objects at the same time and faces limitations like non‐repudiations, injection of fake objects, and unclonability issues. Alternatively, security limitations between tags and readers are analyzed and found that whole communication depends on limited computational resource and simple operations such as hash function, XOR operation, and so forth. Moreover, the communication channel between reader and backend server is secure due to symmetric or asymmetric key encryption algorithms. As the information is exchanged by the tags with readers, a secure path must be maintained among them for safe communication with cloud server. For the development of secure path and verification of objects, ECC‐based Cramer‐Shoup encryption, cryptographic authentication protocol (CAP), and device fingerprinting can be used. To overcome the existing limitations, we are motivated to design an ECC‐based secure object tracking and key exchange protocol that allows the owner device to be offline during communication. This suggested scheme is referred as ESOTP. Several recognized cryptographic attacks are evaluated, the security strength is validated and found that ESOTP is resilient against those attacks. Finally, a comparative study is performed regarding the security features and performance efficiency of ESOTP with other existing schemes and enhanced results are found.

In this paper, we provide an improved Electronic Voting System (EVS) for political and social elections based on known Cryptographic schemes. In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm which is based on Diffie-Hellman key exchange. We will use the ElGamal algorithm to generate and encrypt random keys for the voters. This scheme is designed in a way that the communication channels are anonymous and in the meantime privacy, eligibility and fairness are applied to the entire system. Encrypted receipt-free transactions are provided to the voters after they submit a vote successfully. After the voting completes the voters can check on voting online using the encrypted receipt, only to confirm their participation in the election. The voters will not be aware of the chosen candidate to prevent cheating and vote selling, common issues in elections these days. The name of the chosen candidate will be confidential. The proposed voting system efficiently gives the opportunity for people to vote via their own PCs/laptops, thus decreases the queues accumulated up at voting centers. In addition, it offers a highly dependable authentication approach by national ID or biometrically which leads to overcoming electoral fraud.

With the rapid technological advances, possibility of tampering information have been increased. Cryptography is the science of information security that includes symmetric encryption and asymmetric encryption which used to avoid the tampering attempts and guarantee the data integrity. This paper discusses a cryptography algorithm (CARCA), which is combination between two types of cryptography (symmetric cryptography "AES" and asymmetric cryptography "RSA"). The objective of this paper demonstrating CARCA method to encrypt the outputted hash digest generated by Gear hash function for protecting the digital Holy Quran.

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.