Decryption Speed Research Articles

Design and implementation of keycode encryption for electric door lock embedded system using cryptography algorithm

In this digital era the usage of locks is no longer only relies on traditional key systems, but also relies on usage of electronic sensors that can improve security system. Now the threat to keyless locking system does not only come from physical sources but also come from non-physical or digital sources. This treat can be prevented by using cryptography to hide digital data in the system. In this research utilizing a raspberry pi and a servo motor as a locking device, a web server as a data storage center, a mobile device software application as a user interface. Raspberry pi is a mini computer that can be used for various needs. The password will be sent over internet from mobile device to web server and raspberry pi will give a command to the servo to unlock and lock. This study will compare between combination of RSA, 3DES, AES 128 bit, and 256bit AES algorithms to obtain an algorithm that could be operated optimally on the system based on encryption and decryption speed. The final result of this study is a method to implement cryptographic algorithms on smart key systems to obtain better security.

Hybrid Method of Document Image Encryption using ECC and Multiple Chaotic Maps

Document imaging is one of the most important technology used to preserve, retrieve and to transmit old documents over the internet. Since open network threatens the security of such documents from being intercepted, the proposed scheme intends to provide enhanced security for such documents. The proposed hybrid algorithm includes Elliptic Curve Cryptography (ECC), and mixed chaotic system. The ECC encrypts the plain image based on the elliptic points generated by selecting a prime number. The mixed chaotic map includes two-dimensional logistic map and three-dimensional Lorenz map. The 2D logistic map is used for confusing the ECC encrypted image and 3D Lorenz map is used for diffusing the confused image. The two levels of confusion, first with byte level and second with bit level are introduced. The two levels of diffusion, first level with Lorenz map and second level with Fibonacci sequences are introduced. Better net pixel change rate and unified average change intensity with flat histogram and low correlation are achieved in this method. The key Sensitivity, Entropy, Mean Square Error, and Peak Signal to Noise Ratio analysis reveal that the proposed method is resistant to any external invasion. The encryption and decryption speed is increased by using programming techniques. The robustness of the algorithm is also checked and found to be robust against noise and loss of information.

Research on neural network chaotic encryption algorithm in wireless network security communication

The rapid development of wireless network brings a lot of convenience to people’s lives, but there are still many problems to be solved in wireless networks. Among them, communication security is the most critical, especially secure transactions on digital currency transactions are even more important. In traditional network communication encryption algorithms such as RSA and ECC, in order to further enhance the reliability of network communication security, the main means is to increase the length of the key, but this brings the complexity and workload of the calculation, and the speed of encryption cannot be realized. Compatible with security, the neural network chaotic encryption algorithm mainly uses the parallelity characteristics of the neural network and the chaotic dynamic characteristics to randomly generate a sequence, which has non-periodic characteristics. Therefore, the wireless network chaotic encryption algorithm is a good wireless communication security encryption algorithm. However, the traditional neural network chaotic encryption algorithm still has some shortcomings in its algorithm’s security performance, encryption speed, encryption efficiency, and anti-deciphering performance. At the same time, the research on neural network chaotic encryption algorithm in wireless communication security is relatively less.In this paper, the performance defect of the original neural network chaotic encryption algorithm is optimized. A dynamic key encryption and decryption neural network chaos algorithm for wireless communication security is proposed. The algorithm is mainly based on the Aihara neural network model and introduces chaos, mapping, and hybrid coding. At the end of the paper, the algorithms before and after optimization are compared. The experimental results show that the algorithm proposed in this paper has a significant improvement in the encryption and decryption speed and anti-deciphering ability of the key.

HYBRID ENCRYPTION ALGORITHMS FOR MEDICAL DATA STORAGE SECURITY IN CLOUD DATABASE

Cloud database are derivatives of Cloud computing. At present, most medical institutions store data in cloud database. Although the cloud database improves the efficiency of use, it also poses a huge impact and challenge to the secure storage of data. The article proposes a hybrid algorithm to solve the data security problem in the hospital cloud database. First, the AES algorithm is improved. The improved algorithm is called P-AES algorithm. The P-AES algorithm is then combined with the RSA algorithm, called a hybrid algorithm. The experimental results show that the hybrid encryption algorithm has the advantages of fast encryption and decryption speed, high security, good processing ability for longer data, and can solve the data security problem in cloud database to a certain extent. The algorithm has been successfully applied to hospital information management system.

A novel accelerated implementation of RSA using parallel processing

Past research has evidently proved that public key cryptosystems are usually slower than symmetric key cryptosystems due to the reason that they use one additional cryptographic key and different methods for encryption and decryption. RSA is one of the most common asymmetric key cryptography algorithms. Recent research has focused on speeding up RSA using various techniques. With the introduction of distributed computing, parallelization of algorithms enables them to run on multiple cores concurrently at a time. RSA consists of two resource intensive operations namely Modular Exponentiation of up to 1024-bit exponents and repeated calculation of Greatest common divisor. Thus, RSA lays the perfect base for application of Montgomery Reduction algorithm to optimize the Repeated Modular multiplication in exponentiation. In this paper we proposed a parallel scheme for RSA using a new parallel data structure known as Concurrent Indexed List of character blocks. The aim of our research was to improve the speed of RSA encryption and decryption using parallelism and also make it compatible with leading industry cryptography standards. We have simulated four different approaches namely both parallel and sequential with and without Montgomery. We have also integrated our parallel paradigm with renowned C++ Crypto library and achieved a speed-up of upto four times than sequential approach. Unlike any other previous approaches, our implementation got easily integrated with any external library and thus can be adopted by any other algorithmic scheme.

A Lightweight and Efficient Secure Hybrid RSA (SHRSA) Messaging Scheme With Four-Layered Authentication Stack

For virtual private network and LAN-to-LAN tunnel sessions, End-to-End security is the main constraint in private messaging scenarios. Internet Protocol Security can negotiate new keys for every communication, but when the key is compromised, it is a problem. Perfect Forward Secrecy is the resolution. In addition, the messaging scheme should be efficient and lightweight for keeping parity with daily needs. The popular Rivest-Shamir-Adleman (RSA) cipher is omnipresent in secure communications but has many scientific problems. So here, in this paper, a lightweight and efficient Secure Hybrid RSA (SHRSA) messaging scheme with four-layered authentication stack is implemented and analyzed. The scheme is resolving the problem of asymptotic very low speed of decryption of RSA, the computational modular exponentiation complexity and partial key exposure vulnerability issues of RSA, and many more. The four-layered authentication stack have eliminated the need of the use of any password, external digital certificates, and a third party for authentication with its own four techniques in a staked way. We have found that in evolutions and analysis of the scheme, it is not only resolving various scientific problems of RSA but also occupying 2%–4% less CPU than main RSA and occupying 1%–3% less memory than main RSA. Its decryption average time has gained 8.858 times compared to the main RSA and gained 2.248 times compared to CRT RSA. We have found that the RSA, CRT-RSA, and SHRSA’s encryption throughput are alike-all are around 6 KB/Sec but decryption throughput of SHRSA has gained 8.5345 times than main RSA and gained 2.1174 times than CRT-RSA. The results obtained have shown us the relevancies of the SHRSA messaging scheme to be integratable as a cipher in Blockchain architectures, cyber-physical systems, and the Internet of Everything.

A multi-layer information dispersal based encryption algorithm and its application for access control

High performance encryption is a key means to minimize security risks as protecting private data in cloud or big data environments. In this paper, a new encryption model SIDA is proposed based on the information dispersal and multi-layer encryption. From theoretical analysis and experiments, it shows that SIDA is secure, can not only significantly improve the speed of data encryption and decryption, but also reduce the bandwidth consumption and re-encryption overhead when revoking authority. Taking SIDA4 algorithm as an example, the encryption speed is about 1.6 times of AES. While the overhead of re-encryption when revoking authority, SIDA4 in communication and computation are 1/4 of AES. The real scenario of access control when using SIDA is also discussed in detail in the paper, which shows great prospects in low bandwidth, high performance and big data applications.

On using Aryabhatta Remainder Theorem to Decrypt a Message with RPrime and Rebalanced RSA

RSA is the most world widely used asymmetric cryptosystem for network transactions. Through this article, we propose a new implementation of Aryabhatta Remainder theorem (ART) in place of the existing Chinese Remainder Theorem (CRT) to solve congruencies in the decryption phase for the faster variants of RSA such as RPrime RSA and Rebalanced RSA. Through our observations, we prove that using ART for CRT has improved the overall decryption speed of RPrime and Rebalanced RSA.

HYBRID RSA based highly efficient, reliable and strong personal Full Mesh Networked messaging scheme

Efficient balancing of privacy and strong authentication in end-to-end (E2E) security constitutes a challenging task in the field of personal messaging. Since RSA is a ubiquitous approach, we here propose a hybrid RSA-based, highly efficient, reliable and strong personal full mesh networked messaging scheme. M-prime RSA and CRT-RSA with shared RSA makes our hybrid RSA decryption much more secure and efficient and protects our users with complete privacy. However, computational modular exponentiation complexity and partial key exposure vulnerability of RSA present two major obstacles. Low modular complexity and asymptotic very slow speed of decryption of RSA, with the ease and speed problem in encryption of RSA are also problems to be solved. Our hybrid RSA cipher resolves all of the above issues and provides protection against exploitation of multiplicative property and homomorphic property of RSA. Our full mesh networking scheme also ensures E2E encryption for all peers. So, our three-way authenticated hybrid RSA messaging scheme achieves a perfect balance of efficiency, security, authentication, reliability and privacy. Consequently, our scheme offers a smarter choice for private messaging in existing, as well as future, internet architectures.

A parallel image encryption algorithm based on chaotic Duffing oscillators

Image encryption has been a popular research field in recent decades. This paper presents a novel parallel image encryption algorithm, which is based on the chaotic duffing oscillators. Image encryption systems based on chaotic Duffing oscillators are show some better performances. In order to be more efficient and secure, we divided the plain-images (original-image) into several pieces. The speed of encryption and decryption is very fast. We use well-known ways to perform the security and performance analysis of the proposed image encryption scheme. The results of the fail-safe analysis are inspiring and it can be concluded that, the proposed scheme is efficient and secure.

Invisible Visual Cryptography**Supported by the National Natural Science Foundation of China under Grant No 61575197, the K. C. Wong Education Foundation, the Fusion Foundation of Research and Education of Chinese Academy of Sciences, and the Youth Innovation Promotion Association of Chinese Academy of Sciences under Grant No 2017489.

We propose to realize visual cryptography in an indirect way with the help of diffractive optics, the pure-amplitude keys being substituted with the phase-only keys that are invisible for common-used intensity detectors, leading to the significantly enhanced security and improved usability for practice. Three typical realizations are provided by using static or dynamic diffractive optical elements, and the new concept of invisible visual cryptography (IVC) may be established. This concept is demonstrated by a compact opto-electronic system with only one spatial light modulator within time-delayed exposure, maintaining the fast speed of decryption and no requirement to the calculation of decryption in conventional visual cryptography. Further, IVC shows the immunity to noises and good information capacity, which is partly inherited from diffractive optics. IVC might suggest a new strategy for visual cryptography with the respective of diverse realizations, such as opto-electronic or even bio-chemical or other methods.

Symmetric cryptosystem based on skew tent map

This paper presents an efficient symmetric cryptosystem based on a non–scaled nor discretized skew tent map (STM); this system is implemented in a USB device interacting with a software module in a personal computer. The USB device uses a dedicated processor that contains a pseudorandom numbers generator (PRNG) to generate uniformly distributed chaotic sequences that satisfy the randomness tests defined in the NIST 800–22SP guide. The software module uses these sequences with substitution and rotation functions to produce cryptograms with confusion and diffusion properties, high level of security, high avalanche effect and high encryption and decryption speed. A variety of analysis and tests has been carried out to prove the security and the validity of the algorithm. Some of the evaluated characteristics are the statistical behavior, correlation, strength against differential attack, entropy, key space, key sensitivity, mutual information, encryption and decryption speed, and randomness test. Additionally, we analyze the structure of the proposed cryptosystem to find some security vulnerabilities; in this part, the analysis are based on known plaintext attack used in the literature on chaotic cryptosystems. In this way, the realized analysis shows that the performance of the proposed algorithm offers a high security level. Mutual information is calculated as evidence of this level of security.

PRIVACY PRESERVING THROUGH MEDIATOR IN DECENTRALIZED CIPHERTEXT POLICY ATTRIBUTE BASED ENCRYPTION

In the previous cryptographic approach, network security is vigorously relied on user attribute based encryption, multiple authorities and cipher text policies to make it more sheltered to some extent. But to seal the lack of security level, cryptography shows keen to enhance the protective approach. Cipher text policy is one of the best cryptographic methods added to enhance the security level in recent networking trends. In this paper, both user attributes and data attributes are used as security credentials. File security is maintained by protecting data and its location. Multiple trusted authorities and Mediators are considered as validation users to make system more secure and reliable. Mediator concept is added to the proposed approach whose role is acting as a middleware between authorities and users for managing user rights. Data is stored in encrypted format and its regarding information can be accessed through the secrete key which is a combination of authority key and mediator key. Decryption speed is enhanced to balance the user waiting and response time. Since there is no storage of any user and data information in authority and mediator the entire data will be hidden. All these approaches enhance the encryption level to make system more secure and highly reliable.

Analytical Comparison Of RSA And RSA With Chinese Remainder Theorem

RSA encryption algorithm is one of the most powerful public key encryption algorithm. The problem with RSA algorithm is that RSA decryption is relatively slow in comparison to RSA encryption. Chinese Remainder Theorem (CRT), a modulo based mathematical theorem, is proposed by researchers as a way to enhance the performance of decryption. CRT minimizes the mathematical computation to large extent, thus improving the speed. CRT is well known for improving RSA’s decryption speed, but it has some drawbacks which limits its usage. The problem is that the limitations or drawbacks of CRT are not highlighted. The goal of this research paper is to address disadvantages of CRT when used for RSA decryption. Apart from the social and economic impacts, this paper covers the effects of research on current cryptographic protocols used by different browsers as well as organizations. In order to achieve goal, we are comparing several factors between RSA decryption with RSA-CRT decryption. We are using JAVA programming language to analyze the decryption algorithms. The significance of this research paper is to serve as the foundation for further research on RSA-CRT decryption. In addition, this paper addresses situations where CRT decryption is faster and beneficial to use by stating its advantages and disadvantages.

Security analysis and enhanced design of a dynamic block cipher

There are a lot of security issues in block cipher algorithm. Security analysis and enhanced design of a dynamic block cipher was proposed. Firstly, the safety of ciphertext was enhanced based on confusion substitution of S-box, thus disordering the internal structure of data blocks by four steps of matrix transformation. Then, the diffusivity of cipher-text was obtained by cyclic displacement of bytes using column ambiguity function. The dynamic key was finally generated by using LFSR, which improved the stochastic characters of secret key in each of round of iteration. The safety performance of proposed algorithm was analyzed by simulation test. The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security. Meanwhile, the proposed algorithm has highly scalability, the dimension of S-box and the number of register can be dynamically extended according to the security requirement.

Designing a high performance cryptosystem for video streaming application

This paper presents the hardware design of a high performance cryptosystem for video streaming application. Our proposed system is the combination of two cryptographic algorithms, symmetric key algorithm and asymmetric key algorithm (also called public key algorithm) to take their benefits. The symmetric key algorithm (ZUC) is used to encrypt/decrypt video, and the public key algorithm (RSA) performs the encryption/ decryption for the secret key. This architecture has high performance, including high security and high processing bit rate. High security is achieved due to the ease of key distribution of the asymmetric key cryptosystem and the secret key can be easily changed. The high processing bit rate of video encryption/decryption is the result of the high speed of encryption/decryption of the symmetric key algorithm. The H.264 video decoder is also integrated into this system to test the functionality of the proposed cryptosystem. This system is implemented in Verilog-HDL, simulated by using the ModelSim simulator and evaluated by using Altera Stratix IV-based Development Kit. The speed of video decryption achieves up to 4.0 Gbps at the operating frequency of 125 MHz, which satisfies applications with high bandwidth requirement such as video streaming.

Building a post-compression region-of-interest encryption framework for existing video surveillance systems

We propose an encryption framework design and implementation which add region-of-interest encryption functionality to existing video surveillance systems with minimal integration and deployment effort. Apart from region-of-interest detection, all operations take place at bit-stream level and require no re-compression whatsoever. This allows for very fast encryption and decryption speed at negligible space overhead. Furthermore, we provide both objective and subjective security evaluations of our proposed encryption framework. Furthermore, we address design- and implementation-related challenges and practical concerns. These include modularity, parallelization and, most notably, the performance of state-of-the-art face detectors. We find that their performance, despite their frequent use in surveillance systems, is not insufficient for practical purposes, both in terms of speed and detection accuracy.

Video Encryption and Decryption on Quantum Computers

A method for video encryption and decryption on quantum computers is proposed based on color information transformations on each frame encoding the content of the encoding the content of the video. The proposed method provides a flexible operation to encrypt quantum video by means of the quantum measurement in order to enhance the security of the video. To validate the proposed approach, a tetris tile-matching puzzle game video is utilized in the experimental simulations. The results obtained suggest that the proposed method enhances the security and speed of quantum video encryption and decryption, both properties required for secure transmission and sharing of video content in quantum communication.

An Approach to Rijndael Algorithm

Rijndael or Advanced Encryption Standard (AES) is the most secure symmetric encryption technique and is available in many different encryption packages. The AES based on the Rijndael Algorithm is an efficient cryptographic technique that includes generation of ciphers for encryption and inverse ciphers for decryption. High security and speed of encryption and decryption is ensured by various operations. It has been standardized by the National Institute of Standards and Technology of the United States (NIST) and comprises three block ciphers, AES-128, AES-192 and AES-256 and it is adopted from Rijndael algorithm. This paper presents a encryption and decryption process of the rijindael algorithm. The paper also explains the comparative study of various rijindael algorithms with other algorithms based on the various parameters.

A fast color image encryption scheme using one-time S-Boxes based on complex chaotic system and random noise

A fast color image encryption scheme based on one-time S-Box is proposed. Three S-Boxes are generated by a complex chaotic system, whose initial values and parameter are dependent on both the random noise and the plain image. Each S-box randomly takes turns to encrypt one of the color components in each pixel adhering to the switching sequence, which is also generated by the complex chaotic system. Some measures are taken to improve the encryption and decryption speed. Simulation results demonstrate the effectiveness of the scheme, so it is suitable for color image encryption.