Search

Big data, cloud computing and other hot areas are the use of personal information, but in the process of using this data, a large number of improper behavior is used to steal personal information. Most of the encryption algorithms in common use nowadays are based on ones that are no longer absolutely secure, such as RSA attacked by factorization, elliptic curves attacked by Pollard's lambda algorithm, and symmetric encryption algorithms attacked by collisions. In this paper, an integrated encryption and compression algorithm is designed, firstly, the data is transformed into the form of matrix, and the Jordan decomposition is used for preliminary compression and encryption from the two-dimensional point of view, and then based on the sparsity of matrix vectors, the compression-aware technique is used for compressing the set of key vectors, and the ciphertext group J produced by Jordan decomposition (which is a string of numbers with matrix diagonal length base √2 N), as well as the set of key vectors Y and the intermediate value Θ produced by compression awareness are obtained in the end. This sidesteps the common algorithms that have already been breached and is able to combine better encryption performance with compression performance while being innovative. [ABSTRACT FROM AUTHOR]

Panda and Chattopadhyay proposed "A Hybrid Algorithm for RSA Cryptosystem" in 2017, they modified well-known algorithm RSA into modulo four prime numbers. Later, Gondaliya, Savani, Dhaduvai and Hossain proposed "Hybrid Security RSA Algorithm in Application of Web Service" in 2018. However, we found that these two papers are highly similar, and the main focus of this article is how to determine the victim the (suffer) and the perpetrator (the plagiarist). [ABSTRACT FROM AUTHOR]

IoT devices typically encompass objects or devices equipped with software and internet connectivity, allowing them to collect data. They have limited processing power, memory, and storage. These limitations can make it difficult to secure these devices, as traditional security measures may not be practical. Implementing security for IoT devices can be challenging due to these characteristics, but several steps can be taken to mitigate these challenges. Elliptic Curve Cryptography (ECC) can secure resource constrained IoT devices by providing a more efficient method of encryption and authentication than traditional methods such as RSA. In this paper, we analyzed the lightweight cryptographic algorithm ECC for securing resource-constrained devices such as IoT and evaluated its performance compared to the RSA cryptosystem. The analysis result indicates that ECC is considered to provide stronger security than RSA for the same key length. The CoAP protocol is applied to devices with limited resources, and an examination of its impact is conducted, considering three key performance metrics: CPU usage, bandwidth efficiency, and message communication latency. [ABSTRACT FROM AUTHOR]

With the increasing number of computer network users, the problem of network communication security has become more and more serious. Encryption technology, as one of the key technologies for securing communication, has important research and application values. However, the security of conventional encryption methods is gradually challenged, and at the same time, traditional encryption algorithms require a large amount of computing resources, which makes it difficult to realize real-time encryption and decryption operations. Therefore, how to improve the confidentiality and efficiency of computer network communication security encryption system has become a current urgent problem to be solved. This paper firstly discussed the analysis of its application in the computer network communication security encryption system based on the ant colony optimization (ACO) algorithm. Through the theoretical analysis of the ACO algorithm in terms of bioheuristic optimization algorithm and the analysis of the characteristics of the algorithm, the optimization scheme of key distribution based on the ACO algorithm was discussed. Then, the differences between the ACO algorithm and the traditional encryption algorithm in terms of encryption duration, key distribution time, encryption strength and random number generation speed were further analyzed and verified by experimental data. The data results showed that the key distribution of the encryption system using the ACO algorithm had higher security and better performance compared with the traditional key distribution algorithm. By counting and comparing the data, it was found that the ACO algorithm showed very obvious advantages in terms of encryption and decryption time, key distribution time, encryption strength and random number generation. This indicates that the ACO algorithm has very important application prospects in computer network communication security encryption systems. [ABSTRACT FROM AUTHOR]

Quantum computing, based on quantum mechanical principle, can potentially provide significant advantages over classical computing. This advantage of quantum computing provides solutions to many previously unsolvable problems in secure communication and finance. IoT is an emerging technology that deals with a large amount of data. The data communicated in IoT need to be secured. The existing security architecture of IoT is based on cryptographic algorithms such as RSA and ECC. Quantum computing had a significant impact on the security of these algorithms. Therefore, our work analyses the security concerns of IoT smart applications and quantum-based solutions. This article provides a survey of quantum computing fundamentals and the impact of quantum computing on IoT security. Thus, this paper aims to provide a wide view of quantum-enabled IoT communication. The main challenges in implementing quantum-enabled communication are also analyzed in our work. [ABSTRACT FROM AUTHOR]

One of the critical goals of advanced cryptography is to protect data privacy. Although protecting sensitive data has always been essential, it has become much more due to the widespread use of cloud services. Conventional encryption schemes have one drawback: data must be decrypted before processing. Best practices have long recommended that data must be secured at rest and in motion when using public cloud services, i.e., we need encryption at the storage as well as at processing levels. Homomorphic encryption is an advanced cryptographic approach in which the processing of encrypted data is possible. In this paper, we have presented the insights required for understanding homomorphic encryption approaches. We examined and compared two partial homomorphic techniques, RSA and Pallier algorithm based on efficiency, base method, and homomorphic property. [ABSTRACT FROM AUTHOR]

Nowadays the resiliency is the main property in any system especially communication infrastructures. Unfortunately, many developers are working on making programs more resilient and reliable, facing people who want to use leaks in an unethical way, and breaking (or trying to break) largely used one-way functions such as MD5, SHA-1, or RSA based algorithms. As an alternative, exploiting Physically Unclonable Functions (PUF) can be a good solution to improve the level of robustness and security for encryption by adding a pinch of randomness when manufacturing it, while enabling the use of true randomness. A PUF is characterized by a 'digital fingerprint', as an identifier, derived from a complex physical object or device, such as IoT. It is like a black box, which takes an input, called Challenge, and producing an output, called Response. Actually, they are different types of PUF, Weak and Strong, depending on the amount and the heterogeneity of challenge-responses pairs. This paper provides the fundamental concepts and techniques needed to develop a robust and resilient PUF-based communication system. This objective is achieved by mathematically defining FUFs, from foundations to the attacks, by relying on more concepts around PUF, such as cryptanalysis, or asymptotic notations. Also, we develop a mutual communication protocol that ensures security between different parties peer-to-peer devices, and devices-server. We concertize the provided fundamentals in a concrete framework that is experimentally validated. [ABSTRACT FROM AUTHOR]

Efficient hardware implementations of public-key cryptosystems have been gaining interest in the past few decades. To achieve the goal, a high frequency as well as low latency Rivest-Shamir-Adleman (RSA) cryptosystem is reported in this paper. To configure such cryptosystem shift-add multiplier have been re-constructed and binary digit based modular exponentiation circuitry is proposed. Such exponentiation circuitry has been implemented through binary bit distribution technique, where, most significant bit (MSB) has been discarded for the implementation, owing to increase the operating frequency. The functionality of the reported algorithms were justified and compared in Hardware Description Language (HDL), simulated in Modelsim and synthesized in Xilinx ISE 14.2 platform. The proposed hardware implementation of RSA algorithm has a maximum frequency of operation of 545 MHz and 298 MHz for the bit sizes of 8 and 64 respectively. The proposed method shows improvements in terms of speed as well as in number of Look-up-tables (LUTs). Moreover, application-specific integrated circuit (ASIC) implementation of such cryptosystem of RSA was carried out through Encounter® RTL Compiler v11.10-p005_1 of Cadence® tool. [ABSTRACT FROM AUTHOR]

The problem of unauthorized access to various content is an important task for the present. It becomes even more acute when using the existing toolkit for the processing and transmission of encrypted images with the fluctuation intensity function. The authors developed a modification of the RSA algorithm to use it in relation to the above-mentioned images. It is proposed a conceptual view for the joint use of quaternary fractional-linear transformations with elements of the basic RSA algorithm. The application of this mathematical apparatus in the basic RSA algorithm avoids contours of image objects in an encrypted sample. In addition, this combination provides additional stability to the basic RSA algorithm for unauthorized decryption. The simulation of the method was carried out in two described by the authors algorithms: using one line and four lines of the image matrix, for grayscale and color images. The high efficiency of the developed method for avoiding contours of objects on encrypted images has been confirmed. In both cases, contours after applying encryption procedures do not appear. The reverse procedure allows to get an image without visible distortion. [ABSTRACT FROM AUTHOR]

Information protection services based on the use of elements of the RSA algorithm are quite reliable because the cryptostability of this method is high (RSA keys from 2048 bits and more). However, in terms of image encryption, in some cases, this algorithm leaves outlines of objects in an encrypted image. This imposes a number of additional limitations on the application of this algorithm. Avoiding partially saving contours in encryption using RSA can be by splitting the initial image into parts so that the image coating is topologically locally finite, that is, compact. The paper proposes a method of encryption-decryption using elements of the RSA algorithm and the topological image coverage. Such a combination will provide both a avoiding of the aforementioned disadvantage and an additional increase in cryptostability. The simulation of the method was done on grayscale and color images using two developed algorithms. The absence of contours of objects of input images in encrypted images of both types is experimentally established. The proposed solution can be used for any type of image, but the greatest benefits are achieved when using images with fluctuation intensity function. [ABSTRACT FROM AUTHOR]

Modular exponentiation is an exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography. Most technological applications of modular arithmetic involve exponentials with very large numbers. In this paper, we propose a high radix reconfigurable implementation for the Right-to-Left Modular Exponentiation with NAF-Representation by exploiting the maximum possible parallelism of the internal operations. The proposed design targeted the ALTERA Cyclone IV FPGA (EP4CGX22CF19C7) along with Quartus II simulation package. The proposed design was evaluated in terms of the maximum operational frequency, the total path delay, the total design area and the total thermal power dissipation. The synthesized results revealed that the proposed high radix architecture implementation has recorded: critical path delay of 25.5 ns, maximum operational frequency of 44.59 MHz, hardware design area (number of logic elements) of 2556 LEs, and total thermal power dissipation estimated as 221.82 mW. Consequently, the proposed modular exponentiation architecture can be efficiently employed by many public key cryptographic mechanisms. [ABSTRACT FROM AUTHOR]

A new conceptual scheme of encryption-decryption of grayscale and color images is proposed. It is based on the combining use of elements of the RSA algorithm and projective transformations. Application of the latter in the proposed scheme further increases the cryptographic stability of the method. The algorithmic implementations of the method developed on the basis of the proposed scheme for both element-by-element and for two-element image encryption-decryption is presented. The simulation of the method was carried out using algorithms of element-by-element and two-element encryption-decryption of grayscale and color images. It is established that encrypted images do not have contours of the original images, which provides the requirements for encryption. In addition, the effectiveness of the decryption procedure, where the resulting images haven't visible defects, is confirmed experimentally. [ABSTRACT FROM AUTHOR]

In today's internet era, with online transactions almost every second and terabytes of data being generated everyday on the internet, securing information is a challenge. Cryptography is an integral part of modern world information security making the virtual world a safer place. Cryptography is a process of making information unintelligible to an unauthorized person. Hence, providing confidentiality to genuine users. There are various cryptographic algorithms that can be used. Ideally, a user needs a cryptographic algorithm which is of low cost and high performance. However, in reality such algorithm which is a one stop solution does not exist. There are several algorithms with a cost performance trade off. For example, a banking application requires utmost security at high cost and a gaming application sending player pattern for analytics does not bother much about security but needs to be fast and cost effective. Thus, amongst the cryptographic algorithms existing, we choose an algorithm which best fits the user requirements. In, this process of choosing cryptographic algorithms, a study of strengths, weakness, cost and performance of each algorithm will provide valuable insights. In our paper, we have implemented and analyzed in detail cost and performance of popularly used cryptographic algorithms DES, 3DES, AES, RSA and blowfish to show an overall performance analysis, unlike only theoretical comparisons. [ABSTRACT FROM AUTHOR]

Authenticated key agreement protocol must put in a nutshell of competent and strong cryptographic algorithm which is ensure confidentiality and integrity of message. Key Agreement Protocol using Elliptic Curve Cryptography provide significant development in cryptography to protect integrity, user anonymity and confidentiality of data than RSA, DSA. To examine, at a fundamental level, the environment of existing key agreement protocol. So that improved elliptic curve cryptosystem addressing implementation of secure key agreement protocol with greater security. To study network security tools in order to establish key agreement between two party or multi party communications various techniques and algorithms for implementation elliptic curve cryptosystem are discussed. Therefore suggested protocol can apply on wireless network to condense the security, performance requirement and cost of computation. [ABSTRACT FROM AUTHOR]

Remote user authentication is one of the most commonly used mechanisms to verify the legitimacy of a remote user over insecure communication channel. In remote user authentication, the server and the user mutually authenticate each other and establish a common session key for future communication. In this paper, we propose a secure and effective two-factor remote user authentication scheme based on RSA, which achieves mutual authentication and user anonymity properties. Informal security analysis ensures that the proposed scheme is secure against various malicious attacks and its security is based on the one-way hash function, smart card, and RSA algorithm. Performance comparison shows that the proposed scheme is efficient in terms of communication and computation overhead. Furthermore we demonstrate the validity of our proposed through BAN logic, which confirm that the proposed scheme achieve mutual authentication and session key agreement securely. [ABSTRACT FROM AUTHOR]

RSA Cryptosystem is considered the first practicable secure algorithm that can be used to protect information during the communication. The significance of high security and efficient implementations of RSA have formed the base of many cryptographic engineering researches. In fact, the implementation of RSA Cryptosystem is heavily based on modular arithmetic and exponentiation involving large prime numbers. In this paper, we propose an efficient FPGA design and architecture for RSA cryptosystem using ALTERA FPGA Hardware Kit. The proposed design comprises six levels: random two prime numbers, parallel multiplication of the prime numbers and their decremented values, get encryption key, get decryption key, encryption and decryption levels. As the modular multiplication is considered as the heart of RSA computations, Interleaved Algorithm was particularly chosen as an efficient solution to speed up the modular multiplication. The experimental part of this work has been synthesized for both ALTERA Cyclone IV EP4CE115F29C7 and VERTIX VII VC707 FPGA kits and resulted in a maximum frequencies of 15.725MHz, 17.629MHz respectively. These findings make our design comparable and a good choice for efficient RSA Cryptoprocessor design. The results for the FPGA implementation for EC design using these curves is also proposed in this paper. [ABSTRACT FROM AUTHOR]

RSA Cryptography is a well-known example of public key cryptographic algorithms that involves robust encryption/decryption processes. In this paper, a microcontroller based RSA is designed and proposed. Arduino Mega2560R3 microcontroller supported with external memory and a screen touch LCD as well as a double keypad has been used under the programming of C language to implement the proposed RSA coprocessor with 32 bits. It was found that the trade of between message size and the encryption time can be drawn as a liner relationship according to the block size of the encryption phase. However, such design with a MCU provided with a small solar cell (and off course with a backup battery) as well as small block sizes is considered useful for the use in wireless sensor network (WSN) applications due to the ease of connecting the MCU to the WSN which as well avoid the processing time of encryption/decryption processes that could be executed by the MCU instead of the life limited sensors. [ABSTRACT FROM AUTHOR]