International Data Encryption Algorithm Research Articles

Innovative Soft Cryptosystem for Encrypting and Decrypting Messages with IDEA

This paper introduces an advanced cryptosystem for message encryption and decryption, integrating the International Data Encryption Algorithm (IDEA) with soft set and soft matrix principles. Soft sets, conceptualized by Molodtsov, are adept at managing uncertainty, making them ideal for cryptographic frameworks. Our approach utilizes inverse and characteristic products of soft sets and matrices, combined with the robust IDEA algorithm, to significantly enhance security. The IDEA algorithm operates on 64 -bit data blocks with a 128 -bit key, ensuring strong encryption. Additionally, we incorporate the symmetric to introduce complex permutations, further strengthening the cryptographic process by ensuring unique encryptions for identical plaintexts. This layered approach drastically improves resilience against unauthorized decryption. Practical applications demonstrate the system's efficacy, highlighting its superior security and reliability for data transmission in environments with high uncertainty. This innovative cryptosystem provides a formidable solution for contemporary encryption challenges.

Improvement the International Data Encryption Algorithm(IDEA)based on Chaos Theory

Background: The (IDEA), which represents International Data Encryption Algorithm is a widely used cipher algorithm that has raised concerns due to the discovery of numerous weak keys, as highlighted in previous research. These weak keys, specifically those containing consecutive sequences of single digits, have been found to impede the algorithm's evolution and result in a sluggish avalanche effect. To address these vulnerabilities, this research aims to develop an enhanced and secure encryption algorithm by incorporating Chaos Theory principles into IDEA. Materials and methods: The primary objective is to address the weaknesses associated with IDEA's key generation process by leveraging Chaos Theory to generate strong, highly random keys that replace the algorithm's weak keys t. The study also aims to assess the security and cryptographic strength of the enhanced IDEA algorithm through evaluations and comparisons with the original algorithm. Results: The results showed that the proposed key passed 11 tests out of the 15 total tests, while the Traditional key of IDEA passed only 7. This indicates that the proposed method is superior by 4 tests over the Traditional method of generating keys. Also, cipher text 1 with the proposed key passed 10 tests out of the 15 total tests, while with the Traditional key passed only 8 . Conclusion: This indicates the superiority of the proposed method of IDEA in encryption over the traditional method of IDEA.

Cloud data security and various cryptographic algorithms

<p>Cloud computing has spread widely among different organizations due to its advantages, such as cost reduction, resource pooling, broad network access, and ease of administration. It increases the abilities of physical resources by optimizing shared use. Clients’ valuable items (data and applications) are moved outside of regulatory supervision in a shared environment where many clients are grouped together. However, this process poses security concerns, such as sensitive information theft and personally identifiable data leakage. Many researchers have contributed to reducing the problem of data security in cloud computing by developing a variety of technologies to secure cloud data, including encryption. In this study, a set of encryption algorithms (advance encryption standard (AES), data encryption standard (DES), Blowfish, Rivest-Shamir-Adleman (RSA) encryption, and international data encryption algorithm (IDEA) was compared in terms of security, data encipherment capacity, memory usage, and encipherment time to determine the optimal algorithm for securing cloud information from hackers. Results show that RSA and IDEA are less secure than AES, Blowfish, and DES). The AES algorithm encrypts a huge amount of data, takes the least encipherment time, and is faster than other algorithms, and the Blowfish algorithm requires the least amount of memory space.</p>

Vedic Multiplier-based International Data Encryption Algorithm Crypto-Core for Efficient Hardware Multiphase Encryption Design

At present, there are several pieces of research on designing and implementing new cryptographic algorithms that are lightweight and resistant to several, if not major forms of security attacks. However, some algorithms such as the International Data Encryption Algorithm (IDEA), which has been around for some time is yet to record any real threat against its functionality. To ensure its continued usage, current implementations rely on multiphase encryption where it is combined with other algorithms such as ROTation (ROT) and Data Encryption Standard (DES) for maximum security strength. Multiphase encryption implies that there is a tendency for an increase in hardware area and a reduction in overall speed. In such cases, having fast and reduced area algorithms are much desired. This paper, therefore, proposes an efficient hardware implementation of the IDEA cipher that is based on arithmetic modulo multiplication—one of the main computations of the IDEA—on a novel Vedic multiplier architecture. The increase in efficiency of the IDEA crypto architecture and the reduction in resources utilization is achieved through an enhancement of its structural architecture to utilize a fixed set of resources for all eight identical rounds of computation and the use of a proposed fast and lightweight Vedic hardware multiplier. The proposed hardware modification and resulting architecture are designed using the Xilinx ISE and Vivado tools. The architecture is synthesized using Precision Synthesis Tool (PS) and simulated using Modelsim SE 10.6d and ISIM simulation tools. The proposed IDEA cipher is 100% more efficient when designed based on the Vedic multiplier compared to existing designs. The hardware architecture is implemented on Spartan-6-FGG484 Field Programmable Gate Array (FPGA) using Verilog HDL. Verified results show that the proposed Vedic-based IDEA occupied 212 Slices with the Vedic multiplier only occupying 28 Slices out of the total 212. The proposed architecture operates at a maximum frequency of 253.3 MHz.

CHAOTIC IMAGE ENCRYPTION TECHNIQUE

In this paper, we will provide an overview of the mechanisms used in image protection, especially Chaos-based encryption techniques available today. We will see how previously proposed methods such as Data Encryption Standard (DES), Triple Data Encryption Standard (Triple-DES), and International Data Encryption Algorithm (IDEA) have been applied in image protection domain and how new concepts of Chaos-based encryption techniques are superior to traditional methods.The chaotic system is rich in significance and in implication because of sensitivity to change initial conditions, control parameters, ergodicity, random-like behaviour, repeated processing and very high diffusion and confusion properties that are desirable for cryptography.

An efficient data flow material model based cloud authentication data security and reduce a cloud storage cost using Index-level Boundary Pattern Convergent Encryption algorithm

The cloud server stores its unique DE-duplicate data replication cloud storage system as outsourced only data copies. Deduplication cloud storage audits can verify the integrity of data stored in the cloud, while the cloud calculates the need to maintain only one copy of the copied file. The existing de-duplication auditing solutions for cloud storage are vulnerable to brute-force dictionary attacks, which is a disclosure leakage of user privacy and more time consumption to find a duplicate files in cloud. Users must check the integrity of lightweight cloud computing data to create data authentication and retrieve files in the cloud. The proposed system uses a secure Array Preserving Triple Data Encryption (AP3DE) algorithm to verify with confidence the expertise of aggregate technology. In this method to analysis the user upload document before store on cloud. The aggregator to provide an authentication access the data access role to cloud user. Cloud protects the privacy, confidentiality, and integrity of data stored in the cloud by generating the code of the authentication file and the encryption key of the file through the proposed system test. The Index-level Boundary Pattern Convergent Encryption (IBPCE) algorithm integrates dynamic data handling and data exclusion capabilities for secure cloud storage privacy security public audits. The cloud data security using a Convergent international data encryption algorithm used to encrypted data. It is a 64 bit plaintext and cipher text blocks is controlled by 128 bit key. Analysis of safety and efficiency shows that the proposed mechanism is highly efficient and safe. In this proposed IBPCE method to manage and reduce the cloud storage compare to other existing method.

Real-time FPGA implementation of concatenated AES and IDEA cryptography system

<span>The data encryption is one of the most critical issues in the communication system design. Nowadays, many encryption algorithms are being updated to keep pace with the remarkable progress in the communication field. The advanced encryption standard (AES) is a common algorithm that has proved its efficacy. The main drawback of AES is that it uses too simple algebraic structures, since every block is always encrypted in the same way that makes the hacking process possible if the hacker captures the key and the uses S-Box in the input stage. This especially applies to the unwired communication systems where chances of hacking exceed those found in the wired systems. The paper proposes a security enhancement method that is based on utilizing concatenated AES and international data encryption algorithm (IDEA) algorithms. Upon applying the proposed algorithm, the hacking process becomes a great challenge. The paper incorporates the real-time FPGA implementation of the proposed algorithm in the encryption and the decryption stages. Besides, the paper presents a clear analysis of the system’s performance.</span>

Iris based cancelable biometric cryptosystem for secure healthcare smart card

Health related information of an individual is very sensitive and demands a high level of security and privacy. Healthcare providers have the responsibility to ensure that patient information is secure and accessible only to authorized users. Healthcare systems are using biometrics since long for authentication and/or access control purposes. Biometrics can also be used for healthcare data security and privacy. This paper proposes an iris based cancelable biometric cryptosystem to securely store the healthcare data of patients on the smart card. It employs symmetric key cryptography to encrypt the healthcare data and store it on the smart card in encrypted form. We use the fuzzy commitment scheme to bind the secret encryption key with the cancelable iris template of the patient. Our proposed scheme provides user authentication as well as the decryption of healthcare data when needed by using the iris template of the owner of the healthcare smart card. The implementation results show that our proposed scheme provides better performance as compared to other schemes. It can generate an encryption key of a maximum of 252 bits from the input iris template with a false acceptance rate (FAR) of 0 and a false rejection rate (FRR) of 0.07. The generated key can be used for encrypting the health care data of patients using a symmetric encryption algorithm, e.g. Advance Encryption Standard (AES), International Data Encryption Algorithm (IDEA), Blowfish, etc. As compared to a conventional encryption system where the security of the system depends on keeping the key secret, our proposed scheme binds the encryption key with the iris - template of the patient impeccably without the need to store it securely. The security analysis demonstrates that it is not possible for an attacker to retrieve the secret key or healthcare data of the patient from the stolen healthcare card.

Enkripsi Database Sekolah SMK Pembangunan Dengan Algoritma IDEA

One of the algorithms in cryptography that can be used for school database security is the IDEA (International Data Encryption Algorithm) algorithm. The IDEA algorithm is one of the cryptographic algorithms that has various applications in secure data transmission in the scope of networks and distributed measurement systems. Encryption results appear in the form of a notepad. The Open data button is used to find data that will be used for the encryption process. The key checklist is used to input the key length that will be used for the encryption decryption security process. The system displays the IDEA Cryptographic key, can use the IDEA Cryptographic key, the encryption and decryption change process is clearly visible. Encryption is done on the SMK Pembangunan school database with IDEA algorithm and designing the student database encryption application based on the name of the SMK Pembangunan using Visual Basic programming language.

Information Security using Cryptography and Image Steganography

Typically, hackers are ready to hack the confidential documents for their vested interests. The main challenge is to construct a secure relation between the secret message and image quality. To avoid dangerous illegal attacks by the third person, a scheme is proposed to have a combination of cryptography and image steganography techniques. This scheme will enable the security, secret message and image cannot be extracted. The International Data Encryption Algorithm (IDEA) cryptographic algorithms and Discrete Cosine Transform (DCT) based steganography algorithm is chosen for the functionality. Cryptography is used to encrypt and decrypt the document. Steganography to hide document inside an image with increasing payload for the secure transmission of confidential data across the internet. In this paper we present a single application to hide the information by the sender, which is so important document and confidential in the form of files, it will be invisible to unauthorized person. The results of a suggested scheme with respect to PSNR of 90.06 dB with a payload of 52,400 bytes of information in an image.

SMT Solver-Based Cryptanalysis of Block Ciphers

Satisfiability modulo theories (SMT) is a powerful framework for solving constraint satisfaction problem expressed in first-order logic and mainly used for software and hardware verification. In this article, we demonstrate the power of SMT solvers in cryptanalysis. We propose an algorithm for cryptanalysis of block ciphers using SMT solvers. In the cryptanalytic attack, we represent a block cipher in terms of Boolean equations and convert them into a suitable format (i.e. SMT-LIB). Finally, we use SMT solvers to find the key. An important feature of our attack is that it requires a few plaintext-ciphertext pairs to recover the secret key. We use the propose algorithm to demonstrate the cryptanalysis of International Data Encryption Algorithm (IDEA). We use various serial and parallel SMT solvers to apply known plaintext attack on IDEA and compare their performances. SMT solver can recover full key for three round of IDEA and 32 unknown key bits for full IDEA cipher, assuming 96 key bits are known. Furthermore, we compare our results with existing attacks on IDEA.

Multiscale transform-based secured joint efficient medical image compression-encryption using symmetric key cryptography and ebcot encoding technique

Due to the huge advancement in technology, digitizing the multimedia content like text, images and videos has become easier. Everyday huge amounts of multimedia content are shared through the social networks using internet. Sometimes this multimedia content can be hacked by the hackers. This will lead to the misuse of the data. On the other hand, the medical content needs high security and privacy. Motivated by this, joint secured medical image compression–encryption mechanisms are proposed in this paper using multiscale transforms and symmetric key encryption techniques. The multiscale transforms involved in this paper are wavelet transform, bandelet transform and curvelet transform. The encryption techniques involved in this paper are international data encryption algorithm (IDEA), Rivest Cipher (RC5) and Blowfish. The encoding technique used in this paper is embedded block coding with truncation (EBCOT). Experimental results are done for the proposed works and evaluated by using various parameters like Peak Signal-to-Noise Ratio (PSNR), Mean Square Error (MSE), Image Quality Index (IQI) and Structural Similarity Index (SSIM), Average Difference (AD), Normalized Cross-correlation (NK), Structural Content (SC), Maximum difference (MD), Laplacian Mean Squared Error (LMSE) and Normalized Absolute Error (NAE). It is justified that the proposed approaches in this paper yield good results.

Performance Evaluation of Parallel International Data Encryption Algorithm on IMAN1 Super Computer

Distributed security is an evolving sub-domain of information and network security. Security applications play a serious role when data exchanging, different volumes of data should be transferred from one site to another safely and at high speed. In this paper, the parallel International Data Encryption Algorithm (IDEA) which is one of the security applications is implemented and evaluated in terms of running time, speedup, and efficiency. The parallel IDEA has been implemented using message passing interface (MPI) library, and the results have been conducted using IMAN1 Supercomputer, where a set of simulation runs carried out on different data sizes to define the best number of processor which can be used to manipulate these data sizes and to build a visualization about the processor number that can be used while the size of data increased. The experimental results show a good performance by reducing the running time, and increasing speed up of encryption and decryption processes for parallel IDEA when the number of processors ranges from 2 to 8 with achieved efficiency 97% to 83% respectively.

Performance Evaluation of Parallel International Data Encryption Algorithm on IMAN1 Super Computer

Distributed security is an evolving sub-domain of information and network security. Security applications play a serious role when data exchanging, different volumes of data should be transferred from one site to another safely and at high speed. In this paper, the parallel International Data Encryption Algorithm (IDEA) which is one of the security applications is implemented and evaluated in terms of running time, speedup, and efficiency. The parallel IDEA has been implemented using message passing interface (MPI) library, and the results have been conducted using IMAN1 Supercomputer, where a set of simulation runs carried out on different data sizes to define the best number of processor which can be used to manipulate these data sizes and to build a visualization about the processor number that can be used while the size of data increased. The experimental results show a good performance by reducing the running time, and increasing speed up of encryption and decryption processes for parallel IDEA when the number of processors ranges from 2 to 8 with achieved efficiency 97% to 83% respectively

Authentication Security in Radio Frequency Identification with IDEA Algorithm

Data security on Radio Frequency Identification (RFID) cards for parking security applications need to be applied for more protection especially information on RFID cards, as well as to improve security on RFID access authentication and verification using cryptography algorithm, one of the algorithms that can be used for authentication and verification in RFID communication process is International Data Encryption Algorithm (IDEA) algorithm, the results obtained that the data security on RFID can work well.

Super-Encryption Cryptography with IDEA and WAKE Algorithm

The security and confidentiality of information becomes an important factor in communication, the use of cryptography can be a powerful way of securing the information, IDEA (International Data Encryption Algorithm) and WAKE (Word Auto Key Encryption) are some modern symmetric cryptography algorithms with encryption and decryption function are much faster than the asymmetric cryptographic algorithm, with the combination experiment IDEA and WAKE it probable to produce highly secret ciphertext and it hopes to take a very long time for cryptanalyst to decrypt the information without knowing the key of the encryption process.

An Improved IDEA-ECB Based on Multithread Technology

In terms of the problem that the encryption rate of International Data Encryption Algorithm (IDEA) is low, and it’s throughout capacity is small under the ECB packet mode, this paper proposes a kind of improved IDEA-ECB based on multithread technology. Change the order flow of single thread into concurrent flow of multithread with clocking plaintext and multithread technology, which improve the encryption rate and throughout capacity, at the same time reduce the operation hours of encryption algorithm, and satisfy the demand that real time and high effectively software encryption in instant messaging. Experimental results show that if the size of plaintext is 1MB, the number of threads which is started respectively is 4,8,12,16, the speedup of improved algorithm increases 1.72~4.08 times than classical algorithm.

Cryptanalytic Attacks on IDEA Block Cipher

International data encryption algorithm (IDEA) is a secret key or symmetric key block cipher. The purpose of IDEA was to replace data encryption standard (DES) cipher, which became practically insecure due to its small key size of 56 bits and increase in computational power of systems. IDEA cipher mainly to provide data confidentiality in variety of applications such as commercial and financial application e.g. pretty good privacy (PGP) protocol. Till 2015, no successful linear or algebraic weaknesses IDEA of have been reported. In this paper, author explained IDEA cipher, its application in PGP and did a systematic survey of various attacks attempted on IDEA cipher. The best cryptanalysis result which applied to all keys could break IDEA up to 6 rounds out of 8.5 rounds of the full IDEA cipher1. But the attack requires 264 known plaintexts and 2126.8 operations for reduced round version. This attack is practically not feasible due to above mention mammoth data and time requirements. So IDEA cipher is still completely secure for practical usage. PGP v2.0 uses IDEA cipher in place of BassOmatic which was found to be insecure for providing data confidentiality.

Chaotic Image Encryption Technique based on IDEA and Discrete Wavelet Transformation

Objective: To provide secure image to the user within less processing time. Methods: Due to increase in multimedia traffic the intruders become more active to misuse the personal data including images. Therefore it is important to protect the images being shared. Hence in this research, image is encrypted using International Data Encryption Algorithm (IDEA) known as A-IDEA. First the image is divided into different parts and then DWT is applied. Application of Discrete Wavelet Transformation (DWT) results in confusion of pixels i.e. pixels get jumbled due to which it is impossible to depict the original image. Results: This procedure increases security of the image transmission and helps to reduce the computational delay. Conclusion: A new algorithm based on DWT and IDEA for image encryption is proposed which results in less computational and processing delay.

On the estimation of the second largest eigenvalue of Markov ciphers

AbstractDifferential cryptanalysis is an effective tool in modern cryptanalysis. The differential chain of a Markov cipher forms a Markov chain, and the second largest eigenvalue (SLE) of the transition matrix determines the number of iterations such that the Markov cipher can resist differential cryptanalysis. Owing to the huge scale of the transition matrix, it is infeasible to compute the SLE. Thus, an estimation method would be desirable. We find two methods to estimate the SLE by using the elements of the row‐stochastic matrix in the literature. Their advantage is parallel computing, without generating the complete matrix. We apply these two methods to the transition matrix of International Data Encryption Algorithm(8) and investigate the accuracy of such estimation. Because the International Data Encryption Algorithm is a primitive Markov cipher, its transition matrix will converge to a uniform distribution. We use the power of the initial transition matrix to estimate the SLE for different number of rounds and compare the results. The errors of the estimation will be acceptable after several rounds when there are less zero elements in the transition matrix and the distribution is more uniform. Moreover, we present a simple relation between the SLE and the number of iterations that the Markov cipher requires against differential cryptanalysis and show the necessary condition of the matrix decomposition method. Copyright © 2016 John Wiley & Sons, Ltd.