Asymmetric Encryption Algorithm Research Articles

The elliptic scalar multiplication graph and its application in elliptic curve cryptography

In this work, a new graph has been defined as a main point to design a new version of an asymmetric encryption scheme. This graph is formed based on the scalar multiplication operation on elliptic curve defined over a prime field, which is called an elliptic scalar multiplication (ESM) graph. Some mathematical facts to show the ESM graph is a complete graph are proved theoretically. On the complete elliptic scalar multiplication (CESM) graph, an asymmetric encryption algorithm has been implemented. Fast computations on the proposed algorithm are Z obtained through the matrices representation and determination of the minimum spanning tree (MST) to compute the ciphertext. More secure computations with the CESM graphic encryption algorithm in comparison with the previous asymmetric encryption algorithms. So, the CESM graphic asymmetric encryption algorithm is considered as a new sight for elliptic curve cryptographic usages.

An improved NFC device authentication protocol.

Aimed at the security authentication problem between Near Field Communication (NFC) devices, this paper uses the technology of asymmetric encryption algorithm, symmetric encryption algorithm, hash function, timestamp and survival period to improve the confidentiality, performance and security of the protocol. The symmetric encryption algorithm encrypts the transmission content, while the asymmetric encryption algorithm encrypts the shared key. The whole authentication process is secure, and the key distribution is secure. The improved NFC device authentication protocol can effectively resist the brute force attack, man-in-the-middle attack and replay attack in the authentication process, it can reduce the number of message transmission in the authentication process, improve the transmission efficiency, enhance the confidentiality, integrity, non-repudiation and improve the security of NFC device authentication.

Модель преобразователя «биометрия-код» на основе искусственных нейронных сетей для анализа термограмм лица субъектов

Existing asymmetric encryption algorithms involve the storage of a secret private key, authorized access to which, as a rule, is carried out upon presentation of a password. Passwords are vulnerable to social engineering and human factors. Combining biometric security techniques with cryptography is seen as a possible solution to this problem, but any biometric cryptosystem should be able to overcome the small differences that exist between two different implementations of the same biometric parameter. This is especially true for dynamic biometrics, when differences can be caused by a change in the psychophysiological state of the subject. The solution to the problems is the use of a system based on the "biometrics-code" converter, which is configured to issue a user key after presentation of his/her biometric image. In this case, the key is generated in advance in accordance with accepted standards without the use of biometric images. The work presents results on using thermal images of a user for reliable biometric authentication based on a neural network "biometrics-code" converter. Thermal images have recently been used as a new approach in biometric identification systems and are a special type of biometric images that allow us to solve the problem of both the authentication of the subject and the identification of his psychophysiological state. The advantages of thermal imaging are that this technology is now becoming available and mobile, allowing the user to be identified and authenticated in a non-contact and continuous manner. In this paper, an experiment was conducted to verify the images of thermograms of 84 subjects and the following indicators of erroneous decisions were obtained: EER = 0.85 % for users in the "normal"state.

Quantum logistic image encryption algorithm based on SHA-3 and RSA

This study proposes a quantum logistic image encryption algorithm based on the Rivest–Shamir–Adleman (RSA) and secure hash (SHA-3) algorithms. First, the asymmetric encryption algorithm RSA is used to randomly generate key pairs with private key and public key. A fixed matrix is then produced to confuse the plain image by additive modular operation and get preprocessed image. Second, the preprocessed image is computed by the hash function SHA-3 to obtain the plain message that is then stored secretly. Using RSA algorithm, the cipher message can be obtained corresponding to the plain message. After combining both the plain and cipher messages, the initial conditions of the quantum logistic map are calculated using a new mathematical model. Random keystream can then be generated from the quantum logistic map. Third, the keystream is further employed to cyclically confuse row and column pixels in the preprocessed image with different directions. Then, diffusion operations to odd row and odd column are carried out followed by even row and column, respectively. Finally, the cipher image can be reconstructed by both inverse cyclic confusion and inverse diffusion to each row and column. The test results show that the algorithm has strong plaintext sensitivity and key sensitivity as well as an enhanced ability to resist various cryptographic attacks. Therefore, the proposed algorithm is suitable for secure communication of network image in conjunction with a public cryptosystem.

Symmetric and Asymmetric Encryption Algorithm Modeling on CPU Execution Time as Employed Over a Mobile Environment

This paper presents results on modelling of AES and RSA encryption algorithms in terms of CPU execution time, considering different modelling techniques such as linear, quadratic, cubic, and exponential mathematical models, each with the application of piecewise approximations. C#.net framework is used to implement this study. The authors consider the symmetric encryption algorithm named AES and the asymmetric encryption algorithm named RSA to carry out this study. This study recommends quadratic piecewise approximation modelling as the most optimized model for modelling the CPU execution time of AES and RSA towards encryption of data files. The model proposed in this study can be extended to other symmetric and asymmetric encryption algorithms, besides taking them over a mobile cloud environment.

Privacy Protection Method of Electric Power Network Based on Blockchain

In order to ensure the integrity and confidentiality of power data in the era of big data, it is very important to protect the privacy of smart grid data information. Analyzing electricity big data can obtain electricity consumption habits of electricity users to guide the formulation of power supply plans. This experiment uses an asymmetric encryption algorithm. The encryption and decryption of the asymmetric encryption algorithm use two different keys to fully guarantee the security of the blockchain system. The experiment is based on the blockchain technology in photovoltaic microgrid electricity trading, which belongs to the current type of trading, which is divided into five stages. The service provider is a node of the blockchain system. All smart contracts are encrypted by the private key of both parties in the transaction and the public key of the service provider, which fully guarantees the privacy of users. The experimental data shows that the smart contract is decrypted by the private key and the public key of both parties, so as to obtain the relevant information of the transaction and make the corresponding power dispatch work during the transaction period.The blockchain system solves the security and privacy issues of both parties in the absence of a third-party intermediary. Therefore, the use of blockchain technology can achieve a higher degree of automation for point-to-point power transactions.

Lightweight Cryptographic Algorithms for Guessing Attack Protection in Complex Internet of Things Applications

As the world keeps advancing, the need for automated interconnected devices has started to gain significance; to cater to the condition, a new concept Internet of Things (IoT) has been introduced that revolves around smart devicesʼ conception. These smart devices using IoT can communicate with each other through a network to attain particular objectives, i.e., automation and intelligent decision making. IoT has enabled the users to divide their household burden with machines as these complex machines look after the environment variables and control their behavior accordingly. As evident, these machines use sensors to collect vital information, which is then the complexity analyzed at a computational node that then smartly controls these devicesʼ operational behaviors. Deep learning‐based guessing attack protection algorithms have been enhancing IoT security; however, it still has a critical challenge for the complex industries’ IoT networks. One of the crucial aspects of such systems is the need to have a significant training time for processing a large dataset from the networkʼs previous flow of data. Traditional deep learning approaches include decision trees, logistic regression, and support vector machines. However, it is essential to note that this convenience comes with a price that involves security vulnerabilities as IoT networks are prone to be interfered with by hackers who can access the sensor/communication data and later utilize it for malicious purposes. This paper presents the experimental study of cryptographic algorithms to classify the types of encryption algorithms into the asymmetric and asymmetric encryption algorithm. It presents a deep analysis of AES, DES, 3DES, RSA, and Blowfish based on timing complexity, size, encryption, and decryption performances. It has been assessed in terms of the guessing attack in real‐time deep learning complex IoT applications. The assessment has been done using the simulation approach and it has been tested the speed of encryption and decryption of the selected encryption algorithms. For each encryption and decryption, the tests executed the same encryption using the same plaintext for five separate times, and the average time is compared. The key size used for each encryption algorithm is the maximum bytes the cipher can allow. To the comparison, the average time required to compute the algorithm by the three devices is used. For the experimental test, a set of plaintexts is used in the simulation—password‐sized text and paragraph‐sized text—that achieves target fair results compared to the existing algorithms in real‐time deep learning networks for IoT applications.

Effective Methods and Performance Analysis of a Satellite Network Security Mechanism Based on Blockchain Technology

In satellite communication systems, satellite power and processing capacities are limited, which means that storage and security are also constrained. Satellite communication channels are extremely vulnerable to hackers and external interference signals. Protecting satellite networks from illegal information access and use can be extremely challenging. In this paper, an architecture composed of satellite and ground equipment is developed that integrates communication network authentication and privacy protection structures. In the proposed scheme, the communication, registration, authentication, and revocation of information are achieved through stages to improve communication security. The satellite forwards the collected information to a ground base station, which has a strong data processing capacity. The ground base station records all the key parameters in the distributed blockchain, and all malicious node certificates are removed from the system. To further enhance data transmission security, the key is transferred using an asymmetric encryption algorithm. To measure the robustness of using the proposed network architecture, under the same attack condition, an invulnerability analysis is performed. After conducting simulation experiments, the results show that the proposed scheme greatly improves communication security and protection.

Bitmessage Plus: A Blockchain-Based Communication Protocol With High Practicality

We are in the Internet era, when protecting the security of personal information is both vital and challenging. As the most commonly used methods of communication, centralized systems cannot meet the increasing need for information security. Blockchain, with its characteristics of openness, decentralization, and tamper resistance, is an innovative technology underlying Bitcoin. There is potential to use blockchain in developing decentralized and transparent communication systems. Bitmessage is a well-known decentralized messaging system that enables users to exchange messages and prevents accidental eavesdropping. Bitmessage achieves anonymity and privacy by relying on the blockchain flooding propagation mechanism and asymmetric encryption algorithm. Unfortunately, Bitmessage uses proof-of-work as the solution to prevent spam, which wastes computational power and makes it inefficient to be used in practice. To address this problem, we improve Bitmessage with a novel antispam mechanism based on proof-of-space, which requires the user to dedicate a certain amount of disk space to send a message. This improvement reduces the time and computing resource costs by eliminating computationally heavy hash operations. Moreover, we achieve a high level of anonymity by using the stealth address as the destination of the delivered message, which can only be identified by the intended receiver. Finally, we improve the protocol's reliability by taking the blockchain as an immutable database to store the delivered messages.

Об одном методе хранение информации на заданное время

The article is about the problem of storing information for a specified time. A cryptographic protocol is proposed that provides encryption of messages, the decryption of which will be possible no earlier than a specified time. The protocol is an effective combination of a distributed key generation protocol, a proactive secret sharing protocol, an asymmetric encryption algorithm, and an electronic digital signature algorithm. On the basis of such a cryptographic protocol, you can develop and implement a practical data encryption service for a specified time. This is one of the most important problems in ensuring the security of the operation of critical information systems that operate with large amounts of confidential information. In particular, as an application, the developed practical methods and protocols will allow us to develop an alternative model for the operation of the information storage service at a specified time. A simplified model of the operation of the information storage service for a specified time based on this protocol is considered.

Improving the Asymmetric Encryption Algorithm Based on Genetic Algorithm, Application in Online Information Transmission

Within the paper scope, the authors propose to improve two solutions of information security: first, improving the asymmetric key encryption based on genetic algorithm (GA); second, building archit...

Asymmetric Encryption Method Proposed for Arabic Letters Using Artificial Neural Networks

Asymmetric encryption algorithms suffer the problem of high execution time. This paper presents a proposed methodology to perform encryption and decryption of messages written in Arabic, using artificial intelligence represented by artificial neural networks based on the RSA algorithm. The method is based on dividing the message into partial messages. The arrays of weights and biases in the neural network layers are considered the encryption or decryption key, according to their function. All steps of the proposed method and how it works were shown and used in the MATLAB environment to design a system for encrypting and decrypting messages written in Arabic. The results proved the effectiveness of the proposed methodology and its superiority over the RSA algorithm in terms of execution time for both encryption and decryption. The encryption time in the proposed algorithm is close to the time of decryption, unlike what it was in the RSA algorithm, where the encryption time was relatively much greater than the decryption time. The proposed method was tested on four text files of 50KB, 100KB, 150KB, and 200KB, over two hundred iterations. The average improvement in execution time was 1,330ms and 4,497.5ms for encoding and decoding, respectively. KEYWORDS Data protection, decryption, execution time, security, RSA algorithm, performance

Improving the asymmetric encryption algorithm based on genetic algorithm, application in online information transmission

Improving the asymmetric encryption algorithm based on genetic algorithm, application in online information transmission

Multilevel Identification Friend or Foe of Objects and Analysis of the Applicability of Post-Quantum Cryptographic Algorithms for Information Security

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.

A Research on Encryption Methods and Account Security

Nowadays, the virtual world is widely used by increasing of the precautions for the global pandemic. Therefore, the membership systems that are created on the basis of the user accounts have an important role in order to meet the increasing requirements. The most important requirements of the current systems are privacy and delivering of the datas as seamlessly for sending of the datas as security and receiving of the end users datas. The security of an account is enhanced by additional measures such as sms systems, authentication, security question, and robot control along with password complexity to prevent cyber attacks. Symmetric and asymmetric encryption algorithms are composed of easy and convenient methods for data privacy and integrity. In this study, the validity of the used encryption methods in today for the security of user accounts, which are becoming widespread in every field, is analyzed and the role of password complexity in account security is investigated.

Privacy Preserving Location-Based Client-Server Service Using Standard Cryptosystem

Location-Based Mobile Services (LBMS) is rapidly gaining ground and becoming increasingly popular, because of the variety of efficient and personalized services it offers. However, if users are not guaranteed their privacy and there is no assurance of genuineness of server's response, the use of these services would be rendered useless and could deter its growth in mobile computing. This paper aims to provide confidentiality and integrity for communication that occurs between users and location service providers. A practical system that guarantees a user's privacy and integrity of server's response, using a cryptographic scheme with no trusted intermediary, is provided. This scheme also employs the use of symmetric and asymmetric encryption algorithms to ensure secure message and key transfer. In order to overcome the problem of computational complexities with these algorithms, AES-256 is used to encrypt the message and user's location. Several researches have been done in this category but there is still no system that checks the integrity of server's response. The proposed scheme is resistant to a range of susceptible attacks, because it provides a detailed security analysis and, when compared with related work, shows that it can actually guarantee privacy and integrity with faster average response time and higher throughput in LBMS.

Analysis of possibility to use El Gamal algorithm with deterministic embedding for key encapsulation

Suppose some parties, A and B, use some symmetrical encryption algorithm (for example, AES) to encrypt their messages from A to B and from B to A. They get their secret keys from some Trusted Authority (ТА). TA generates keys and then delivers them to correspondent users. The simplest and, may be, the optimal way to deliver the secret key to user A is to encrypt it (using some asymmetrical encryption algorithm) with A’s public key and then to send it to A via public channel. Such procedure is called “key encapsulation”.Key encapsulation algorithms are widely used in the modern cryptography and represented in national and ISO/IEC standards of key encapsulations. Building the key encapsulation algorithm, which may be used as a national standard, is an actual problem nowadays. Ukrainian cryptographers are also working on such standard. Modified Elliptic Curve Integrated Encryption Scheme (ECIES), included in the ANSI X9.63, ISO/IEC 18033-2, IEEE 1363a and SECG SEC1 standards, was used in the project of national standard for key encryption.In this article we propose some alternative encryption algorithm on elliptic curve which also may be used for this purpose.Generally speaking we can use arbitrary asymmetric encryption algorithm for key encapsulation. One of the simplest and preferable algorithms is El Gamal encryption algorithm. To use this algorithm on elliptic curve, we need algorithms for embedding key into point on elliptic curve and for retrieving it back. Several lines of work in both the number theory and cryptography literature have considered the problem of deterministically mapping field element to point on elliptic curve. However, only probabilistic algorithms of such embedding existed until 2016, when deterministic algorithm for hash embedding was proposed. But key embedding is much more complicated procedure than hash embedding, because the correspondent mapping must be bijection.In what follows we describe how this algorithm for key embedding can be built and then discuss the problems that appear if we want to use it in key encapsulation.

Time Evaluation Of Different Cryptography Algorithms Using Labview

A new LabVIEW simulation design was applied to provide a comparison study among several types of the most common symmetric and asymmetric encryption algorithms. Also, the comparison with advanced encryption package program was made. The results showed that the new LabVIEW simulation design had advantages in several points, where the evaluated time required for the encryption and decryption processes will be lesser than it values using advanced encryption package program.In this work, the symmetric encryption algorithms were used: AES (Advanced Encryption Standard), DES (Data Encryption Standard), 3DES (Triple Data Encryption Standard) and RC2 (Rivest Cipher) algorithms, while the asymmetric encryption algorithm used was the RSA (Rivest-Shamir-Aldeman) algorithm. The comparison had been achieved using different sizes of text files with different key sizes. The final results proved that the LabVIEW simulation design is better than the Advanced Encryption Package because it increased the algorithm’s performance by 65% in terms of speed and throughput, and for the algorithms’ comparison, the final results showed the effectiveness of AES algorithm over the other algorithms in terms of speed and throughput for the encryption and decryption processes.

Security Transmission and Storage of Internet of Things Information Based on Blockchain

The Internet of Things is developing rapidly. Many devices around us are connected through the Internet, and humans have entered the era of the Internet of Things. However, while many devices are connected to the Internet, it also provides more attack surfaces for hackers, so the security issues of the Internet of Things are becoming increasingly prominent. This paper uses asymmetric encryption algorithms and blockchain technology to build a key-based security architecture. In terms of information security transmission, this article uses ECC (Elliptic Curves Cryptography, Elliptic Curve Cryptography) and DH (Diffie-Heilman key exchange, Diffie-Heilman key exchange) as encryption tools for the entire architecture, not just for Encrypted communication between IoT devices is also used for encrypted communication between IoT Internet of Things (IoT) devices and Raft service clusters, thereby ensuring the privacy of sensitive information and the efficiency of data communication. In terms of information security storage, this article uses the blockchain data structure and consensus algorithm to achieve reliable storage. Considering the real-time nature of the Internet of Things, the Raft consensus algorithm is adopted. This consensus algorithm has strong consistency in the existing blockchain consensus algorithms, which is more in line with the requirements of the final consensus consensus algorithm of public chains such as POW. The blockchain data structure is used to store the public key data content submitted by each IoT device. The hash pointer in the blockchain data structure guarantees the integrity and difficulty of change of the stored data.

Optical PTFT Asymmetric Cryptosystem-Based Secure and Efficient Cancelable Biometric Recognition System

Recently, biometric systems are extensively and commonly utilized for authentication and verification applications. The security issue and the dependence on a specific biometric for the biometric verification process are the main challenges confronted in biometric systems. The security issue comes due to the exploitation of the original biometrics in stored servers. Therefore, if any attacks have been introduced to the stored biometrics, they will be missed indefinitely. Consequently, the stored original biometrics must be secured through maintaining and storing these templates away from exploitation in their servers. So, there is a need for designing a cancelable biometric recognition system (CBRS) that is a promising protection trend in biometric verification and authentication fields. The CBRS is based on the conversion of biometric data or its features to a different arrangement. In this article, a novel CBRS based on the suggested optical PTFT (Phase Truncated Fourier Transform) asymmetric encryption algorithm is introduced. In the proposed algorithm, two different distributions of phases in the output and Fourier planes are maintained as deciphering keys, and thus, the encryption keys will not be utilized for the decryption process. This leads to the advantage that the two ciphering keys may be utilized as public secret keys to encrypt distinct biometric images. Consequently, the suggested PTFT cryptosystem is an asymmetric encryption/decryption technique compared to the preceding related optical encryption techniques that are symmetric techniques such as Optical Scanning Holography (OSH) and Double Random Phase Encoding (DRPE). The suggested PTFT asymmetric encryption algorithm also has a wonderful practical performance in security applications. One of the main contributions of the proposed optical PTFT asymmetric encryption algorithm is that it removes the linearity features of the optical OSH and DRPE symmetric encryption algorithms through its great features of the phase truncation nonlinear operation. Subsequently, this produces an encrypted biometric template with two public keys, and the authenticated user can retrieve the original biometric template utilizing two private keys with achieving a high security and cancelability performance for the stored biometrics. To confirm the efficacy of the suggested optical encryption algorithm for developing a secure CBRS, various biometric datasets of face, ear, palmprint, fingerprint, and iris images are examined and analyzed. Extensive comparative analyses are performed amongst the suggested algorithm and the optical OSH and DRPE encryption algorithms. The experimental outcomes achieved for performance quality assessment assure that the suggested CBRS is reliable, robust, and realistic. It has great security and cancelability proficiency that expose excellent cancelable biometric recognition performance even in the existence of noise. Moreover, the performed experiments declare that the suggested CBRS guarantee an average FRR (False Reject Rate) of 0.0012, EER (Equal Error Rate) of 0.0019, and FAR (False Accept Rate) of 0.0030, and an average AROC (Areas under the Receiver Operating Characteristic) of 0.9996.