Search

Our world is making its way toward complete digitization, with more and more data going to the Internet. Thus, the security of the data has become one of our utmost responsibilities. Strong and sec...

The evolving cloud technology is capable of accommodating volumes of business processes. This feature attracts many individuals and organizations to store their data over cloud. But there are many security issues that require a deep insight. In this research, articles and surveys on cloud security have been reviewed to identify the issues. Efforts have been made to increase cloud data security by devising a hybrid cryptographic algorithm namely Hybrid Elliptic Curve Cryptography -Triple Data Encryption Standard (ECC-TDES). The hybridized algorithms make data more secure and immune to malicious attacks. The proposed algorithm was applied to database of a cloud-based web application and tested with audio, video, image and text files ranging between 10-100 kb file sizes to record performance metrics such as: encryption time, decryption time and accuracy. The recorded parameter values were compared with individual ECC and TDES algorithms. The findings indicated that ECC-TDES takes more time to encrypt/decrypt files but gives highest accuracy with 0.01% error rate.

This paper reviews some of the encryption models through the block cipher technique used for the data encryption process. As an introduction, we explained Classical Substitution Ciphers by two example models (Caesar Cipher and Vigenere Cipher). They are followed by a block cipher which is presented by multiple encryption triple DES and block cipher modes of operation. Multiple encryption DES algorithms are using two or three keys to make the encryption process more complex. But still using a 64-bit fixed blocks message and also wasted a lot of time during the encryption and decryption process. So we need some ways to encrypt and decrypt arbitrary quantities of data. This paper presents five block cipher modes of operation to cover a wide variety of applications and can be used with any block cipher. يستعرض هذا البحث بعض نماذج التشفير من خلال تقنية تشفير الکتل المستخدمة لعملية تشفير البيانات. کمقدمة، أوضحنا شفرات الاستبدال الکلاسيکي من خلال نموذجين من الأمثلة (سيزر، فيجنر). ينتقل البحث ليوضح تشفير کتلةمن البيانات عن طريق التشفير المتعدد الثلاثي وأنماط تشغيل تشفير الکتلة. تستخدم الخوارزميات متعددة التشفير ذات مفتاحين أو ثلاثة لجعل عملية التشفير أکثر تعقيدا. ولکن لا تزال هذه الخوارزمية تستخدم کتلة بيانات بحجم ثابت 64 بت ، کما أنه أهدر الکثير من الوقت أثناء عملية التشفير وفک التشفير. لذلک نحن بحاجة إلى بعض الطرق لتشفير وفک تشفير کميات البيانات العشوائية والمتغيرة الإحجام. يقدم هذا البحث خمسة أنماط تشفير کتلة لتغطية مجموعة واسعة من التطبيقات ويمکن استخدامها مع أي تشفير لکتلة البيانات. NETWORK SECURITY BY BLOCK CIPHERS

With the increasing interconnection of computer networks and sophistication of cyber-attacks, Cryptography is one way to make sure that confidentiality, authentication, integrity, availability, and identification of data user can be maintained as well as security and privacy of data provided to the user. Symmetric key cryptography is a part of the cryptographic technique which ensures high security and confidentiality of data transmitted through the communication channel using a common key for both encryption and decryption. In this paper I have analyzed comparative encryption algorithms in performance, three most useful algorithms: Data Encryption Standard (DES), Triple DES (3DES) also known as Triple Data Encryption Algorithm (TDEA), and Advanced Encryption Standard (AES). They have been analyzed on their ability to secure data, time taken to encrypt data and throughput the algorithm requires. The performance of different algorithms differs according to the inputs.

This Electronic Health (E-Health) is a broad expression that enables the communication between healthcare professionals in handling patient information through the cloud. Exchanging medical data over the public cloud requires securing transferring for the data that's direct many researchers in proposing different secure schemes to enable users to handle data safely without hacking or alternating. In this study, one of the most common encryption algorithms called Triple Data Encryption Standard (Triple-DES) has been implemented with the aid of the hash function and DNA cryptography base to encrypt different biosignals into DNA format to add a security layer for the proposed system.

Security of the information is additionally significant challenge in cloud. Information encryption in cloud computing is the response to conquer the challenges. Efficient security of gigantic measure of IoT delivered information is a key for wide scale information scientific administrations. Information hub works at the edge side and upgrades information security, exactness, consistency and decreases the dormancy rate which is a significant factor for application like IOT sensor data. In this paper, we present an IoT personality insurance plot for symmetric IoT information encryption. We give fundamental security definitions for this issue setting present another development and give security verifications of safety level accomplished with the development. Execution figures for a proof of idea execution are likewise given. The new plan gives a reasonable compromise between personality security and complexity. The information distinguished will be put away in the information hub. The information gathered from it is being scrambled utilizing Advance Encryption Standard (AES) and Triple DES calculation and it is transferred to the cloud. Hence, the security of the sensor information is improved utilizing cloud computing. In this paper, an efficient hybrid data aggregation scheme changing in accordance with the architecture of IoT is proposed. The proposed hybrid approach is set in the cluster and tree-based data aggregation plans on keeping an eye on the limitations.

Security is one of the main sources of information protection, especially sensitive information that is transmitted over the Internet. Encryption is one of the most important elements used, which is an effective and necessary element to provide high-level security communication between different entities by transmitting unclear and encrypted information that does not allow unauthorized person to access, the method of choosing the appropriate and correct encryption algorithm is important to provide a secure connection that provides a more efficient and accurate encryption system. In this paper, we will review the algorithms (Triple DES, AES & HiSea) for secret key encryption that are most commonly used for this type of encryption.

This work presents an approach for the applying Triple DES (TRIPLE DES) based on using genetic algorithm by adding intelligent feature for TRIPLE DES with N round for genetic algorithm. Encapsulated cipher file with special program which send an acknowledgment to a sender to know who decipher or broken to crash it , Thus it is considered as the initial step to improve privacy. The outcome for proposed system gives a good indication that it is a promising system compared with other type of cipher system.

Cloud computing may be defined as management and provision of resources, software, application and information as services over the cloud which are dynamically scalable. Fault tolerance includes all the techniques necessary for robustness and dependability. The main advantages of using fault tolerance in cloud computing include failure recovery, lower costs and improved standards in performance. Even though the benefits are immeasurable, the element of risk on user applications due to failure remains a major drawback. So our suggested technique utilizes the effective fault tolerance method with the encryption algorithm. To improve the security of the recommended technique, triple-DES encryption algorithm is employed before the data transmission. For the transmission of encrypted data, the implemented method selects the minimum fault tolerance node. So the recommended technique utilizes the effective classification technique. Here, improved support vector machine (ISVM) classifier is used to classify the nodes based on its feature value and the content similarity each node. The proposed ISVM helps in predicting the faults if available, earlier before it occurs. The various parameters considered in our proposed system are accuracy, service reliability and availability. In the proposed method, the accuracy value of the fault tolerance is 79% which is better than in the existing method. The proposed method will be implemented in JAVA with CloudSim.

This paper aims to implement the concept of preserving the Confidentiality and Integrity of DICOM Images Using Cryptographic Algorithms. This work uses two types of cryptographic algorithms namely AES (Advanced Encryption Standard) and Blake Hash Function. Using these algorithms, we implement and check the confidentiality and integrity of DICOM images. Our proposed system also ensures that the images are transferred from one hospital database to another in a secure manner and the system will be able to tackle any changes while the image is being transferred. The initial concern of the system lies in providing confidentiality in the communication of the images which can be done using AES algorithm. The integrity can be provided using Blake Hash Function. The comparative analysis of AES with other algorithms such as Triple DES, IDEA, Blowfish and SEED with respect to their execution time is also done. In this work, DICOM files are taken as input and then kept in the encrypted format for storage purpose and also they can be sent over the network in the encrypted format.

To ensure the safe operation of power system, this paper studies two technologies of data encryption and digital signature, and designs a real-time data encryption system based on DES algorithm, which improves the security of data network communication. The real-time data encryption system of power system is optimized by the hybrid encryption system based on DES algorithm. The real-time data encryption of power system adopts triple DES algorithm, and double DES encryption algorithm of RSA algorithm to ensure the security of triple DES encryption key, which solves the problem of real-time data encryption management of power system. Java security packages are used to implement digital signatures that guarantee data integrity and non-repudiation. Experimental results show that the data encryption system is safe and effective.

Data security and transmission are always be the concern with its importance in wireless sensor network. Today, most of the research works are going on the improvement of security and transmission as well. Transmission of secured data is very essential to maintain data integrity between the sender and the receiver. As data flows in a wireless traffic, it is to be protected from the unauthenticated users by some means. We have proposed a new algorithm for transmitting the encrypted data. Hybridization of existing RSA and Triple DES is executed to obtain the encrypted version of the data to be sent. For decryption too we have used both the algorithms. We have achieved data integrity, confidentiality, and security by means of encryption. NS3 simulator is used to execute the proposed approach. The results obtained is compared with other standard algorithms. Our approach outperforms over existing algorithms.

An introduction to AES algorithm, the algorithm design and features of AES. AES stands forAdvanced Encryption Standard.The more popular and widely adopted symmetric encryption algorithm likely to be encountered nowadays is the Advanced Encryption Standard (AES). It is found at least six time faster than triple DES. A replacement for DES was needed as its key size was too small. With increasing computing power, it was considered vulnerable against exhaustive key search attack.

Wireless Sensor Network (WSN) technology is an integral part of Internet of Things (IoT) and the security of IoT will play a pivotal role in its deployment and commercialization. To secure communication in WSN, selecting appropriate encryption algorithm is essentially important because IoT devices are inherently low-powered and have limited resources. In this regard, in this paper, we compare diverse symmetric block-based cryptographic algorithms to comment on their capabilities that will aid in selecting the right algorithm for a specific application. We select widely used algorithms such as AES, CLEFIA, DES, Triple DES, IDEA, PRESENT, SEA, SPECK, TEA, XTEA and TWOFISH with different block and key lengths. The algorithms are compared from the perspective of energy, power and memory consumption, and throughput. The comparison is performed in Cooja simulator using z1 motes and the source code is published in the GitHub repository.

Cryptographic Algorithms persuade a significant contribution in data security. But they require notable portion of resources like processor time, system memory, power consumption, latency time etc. So, it is needed to find out best cryptographic algorithm by evaluating performance of each of them. This paper evaluates the performance of cryptographic algorithms namely AES, triple DES, Blowfish, RSA, MD5 as well as SHA based on parameters like time required to encipher, time required to decipher and memory used by them. The literature surveys of these algorithms are made and then the system for the measurement of performance is proposed and implemented.

In today’s scenario, Security is the most vital form of features in the network and internet applications. Network and Internet applications are increasing quickly, so the importance of the data swapped over the internet are also growing. Hence to provide the required protection against the data attacks is one of the significant solutions in the security related applications. Block cipher symmetric key cryptography plays a significant part in data security systems. This paper offers a comparison among the commonly used symmetric key cryptography algorithms: DES (Data Encryption standard), Blowfish, TDES (Triple Data Encryption Standard), PRESENT, KLEIN. The comparison of algorithm is performed based on Attacks, key size and block size and providing state-of-the-art results in their field.

Cryptographic techniques have been widely employed to protect sensitive data from unauthorized access and manipulation. Among these cryptographic techniques, Data Encryption Standard (DES) has been widely employed, however, it suffers from key and differential attacks. To overcome these attacks, several DES modifications have been proposed in literatures. Most modifications have focused on enhancing DES encryption key; however, the strength of a cryptographic technique is determined by the encryption key used and the number of encryption rounds. It is a known fact that Advanced Encryption Standard (AES) cryptographic technique with 14 encryption rounds is stronger than AES with 12 rounds while AES with 12 rounds is stronger than AES with 10 rounds. Therefore, this study proposed a DES cryptographic technique whose number of rounds is dynamic. Users are expected to specify the number of encryption and decryption rounds to be employed at run time. Moreover, a predefined number of shifting operations which is left circular shift 2 was chosen for each encryption round. As, a trade-off in complexity, the number of Substitution box (S-box) was also reduced to 4, so that the input to the S-boxes would be arranged in four 12-bit blocks for the X-OR operation and not six 8-bit blocks as in the traditional DES. Finally, three keys were used to encrypt, decrypt and encrypt the plaintext ciphertext as in triple DES. The modified DES yielded a better avalanche effect for rounds greater than 16 though its encryption and decryption time were greater than that of the traditional DES.

Big data stand as a technique to retrieve, collect, manage and also analyze a vast quantity of structured and also unstructured data which are tough to process utilizing the traditional database that involves new technologies to examine them. With the expanding success of the big data usage, loads of challenges emerged. Timeless, scalability and privacy are the chief problems that researchers endeavor to work out. Privacy-preserving is at present a highly active domain of research. To guarantee a safe and trustworthy big data atmosphere, it is imperative to pinpoint the drawbacks of the existing solutions furthermore conceive directions for future study. In the given paper, the security and also the privacy-preserving on big data is proposed concerning the healthcare industry and to beat security issues in existing approach. Mainly anonymizations along with Triple DES techniques aimed at security purpose are incorporated. Triple DES offers a fairly simple technique of increasing the key size of DES to shield against such attacks, devoid of necessitates to design an entirely new block cipher algorithm. Data anonymization work as an information sanitizer whose target is to defend the data privacy. It encrypts or takes away the personally recognizable data as of the data sets in order that the persons about whom the data designate remain anonymous. In this work, a combination of anonymization and Triple DES are utilized that are shortly called as the A3DES algorithm. Experimental outcome reveals that the approach performed well when contrasted with all other related approaches.

Unlike prior efforts in cybersecurity research, a dynamic defense theory, called moving target defense, increases the complexity and costs for attacks by effectively restricting the vulnerability exposure and the attack opportunities through various continually-changing evaluation, development mechanisms and strategy. Data encryption standard (DES) was the classical scheme of the traditional symmetric-key encryption schemes. Now it has been gradually replaced by the triple DES or advanced encryption standard (AES) so that the encoder has a larger key space. However, both the triple DES and AES cannot meet the dynamic security requirements of dynamic defense due to their static extension to the key space. In this paper, we propose a dynamic three-layer encryption scheme based on DES and network coding, with a low-complexity partial key update mechanism. Based on the theoretical analysis, the new scheme is shown to have the benefit to achieve a dynamic transition between efficiency and security, which increases its adaptability to various cyber conditions. The simulation results also show that the running ratio of the new scheme is relatively lower than or comparable to the triple DES.

With the future full shift to cashless and contactless toll fee collection in the Philippines, installation of radio frequency identification (RFID) readers at toll plazas and tags on all vehicles is the most practicable solution. The Department of Transportation recently implemented this initiative to help minimize the transmission of COVID-19. RFID tags in the forms of stickers contains the motorist’s account number which if hacked can be used to access other important details about the owner. With the weak security of these tags, possible instances that information from RFID tags could be accessed. Information derived from these can be easily retrieved if the attacker has access to the tags' data. The worst thing is that public access to the database that contains essential information concerning the holder's account. In this paper, the authors aim to provide more information about tag ID’s encryption that is limited to RFID usage in the Philippine expressways. An algorithm devised by the authors well secures the information contained in the RFID tags.

In this paper, we present and evaluate a hardware implementation of the PRESENT block cipher secured against both side-channel analysis and fault attacks (FAs). The side-channel security is provided by the first-order threshold implementation masking scheme of the serialized PRESENT proposed by Poschmann et al. For the FA resistance, we employ the Private Circuits II countermeasure presented by Ishai et al. at Eurocrypt 2006, which we tailor to resist arbitrary 1-bit faults. We perform a side-channel evaluation using the state-of-the-art leakage detection tests, quantify the resource overhead of the Private Circuits II countermeasure, subdue the implementation to established differential FAs against the PRESENT block cipher, and contemplate on the structural resistance of the countermeasure. This paper provides the detailed instructions on how to successfully achieve a secure Private Circuits II implementation for the data path as well as the control logic.

Kalyna is a block cipher that has been selected as the result of the Ukrainian National Public Cryptographic Competition (2007–2010). Two important criteria for the selection of this new standard cipher were a high level of security and being able to work on modern platforms. After being selected, Kalyna has been slightly modified and approved as the new encryption standard in Ukraine in 2015. Kalyna has SPN (Substitution-Permutation Network)-based structure similar to AES (Advanced Encryption Standard). However, Kalyna has four different sets of SBoxes, a totally different key scheduling compared to AES, and it utilizes modulo key addition in the beginning and at the end of its encryption operation. Kalyna has five different modes of operation. In this paper, we investigate two different fault attacks on Kalyna. In the first attack, we assume that the attacker knows everything about the cipher except its secret key. In the second case, we assume that the SBox entries are also kept secret from the...

On-line ciphers are convenient building blocks for realizing efficient single- pass encryption. In particular, the trend to limit the consequences of nonce reuses rendered them popular in recent authenticated encryption schemes. While encryption schemes, such as POE, COPE, or the ciphers within ElmE/ElmD concentrated on efficiency, their security guarantees and that of all earlier on-line ciphers is limited by the birthday bound, and so are those of the AE schemes built upon them. This work proposes POEx, a beyond-birthday-bound-secure on-line cipher which employs one call to a tweakable block cipher and one call to a 2n-bit universal hash function per message block. POEx builds upon the recently proposed XTX tweak extender by Iwata and Minematsu. We prove the security of our construction and discuss possible instantiations.

A new structure of pre-modular, permutation, and diffusion (PPD) cipher for image encryption is proposed.Solve the low sensitivity of the plain-image when meeting invariance of pixel summation.Self-adaptive encryption scheme is implemented, and no extra transmission is needed.The keystreams used for encryption are designed dependent on the plain-image. Differing from the traditional permutationdiffusion architecture, an efficient symmetric image encryption algorithm is designed in this paper. To resolve the issue of low sensitivity of a plain-image, which is measured by a unified averaged changing intensity and the number of changing pixel rate, pre-modular operation is proposed to be used for pre-processing a classical encryption algorithm. Because of the invariance of pixel summation in the plain-image before and after pixel positions exchange, the keystream used for the permutation operation is designed to be dependent on the plain-image. Since for most encryption algorithms it is hard to implement the diffusion operation in relation with the plain-image dependence, a self-adaptive encryption scheme is proposed as a remedy. Consequently, the keystream for diffusion becomes dependent on the plain-image, which still satisfies the requirement as a symmetric cipher. To that end, by taking full advantage of the chaotic intertwining logistic map and its unpredictability, a new cipher with pre-modular, permutation and diffusion is designed for image encryption, which is then simulated and tested. Numerical experiments and security analysis demonstrate that the new cipher is secure enough for image communication over the open network.

More and more sensitive information is transmitted and stored in computer networks. Security has become a critical issue. As traditional cryptographic systems are now vulnerable to attacks, DNA based cryptography has been identified as a promising technology because of the vast parallelism and extraordinary information density. While a body of research has proposed the DNA based encryption algorithm, no research has provided solutions to distribute complex and long secure keys. This paper introduces a Hamming code and a block cipher mechanism to ensure secure transmission of a secure key. The research overcomes the limitation on the length of the secure key represented by DNA strands. Therefore it proves that real biological DNA strands are useful for encryption computing. To evaluate our method, we apply the block cipher mechanism to optimize a DNA-based implementation of a conventional symmetric encryption algorithm, described as “yet another encryption algorithm”. Moreover, a maximum length matching algorithm is developed to provide immunity against frequency attacks.

We propose an ultra-lightweight, compact, and low power block cipher BORON. BORON is a substitution and permutation based network, which operates on a 64-bit plain text and supports a key length of 128/80 bits. BORON has a compact structure which requires 1939 gate equivalents (GEs) for a 128-bit key and 1626 GEs for an 80-bit key. The BORON cipher includes shift operators, round permutation layers, and XOR operations. Its unique design helps generate a large number of active S-boxes in fewer rounds, which thwarts the linear and differential attacks on the cipher. BORON shows good performance on both hardware and software platforms. BORON consumes less power as compared to the lightweight cipher LED and it has a higher throughput as compared to other existing SP network ciphers. We also present the security analysis of BORON and its performance as an ultra-lightweight compact cipher. BORON is a well-suited cipher design for applications where both a small footprint area and low power dissipation play a crucial role.

In order to improve the performance of block cipher, clustered processor structure is put forward. How to schedule data in multiple clusters will influence the processor performance directly. Based on the analyzing characteristics of block cipher data flow, we propose a data scheduling scheme according to block width and operation mode. The final algorithm mapping and experiment results show that the data scheduling scheme not only meets the data distribution demand of different algorithms, but also reduces the number of instructions that the algorithms need, thus it can enhance the throughput of most algorithms.

Cryptography is a science concerned with securing data transmission. By applying cryptographic operations to data, readable information is converted into unreadable data. Currently, security is of great importance. Data transferred over the internet must have some form of encryption. Different forms of multimedia contents are moved over the internet. This paper focuses on image encryption. It tries to amend the multiple selective region image cryptography techniques using a RC4 stream cipher. This approach is derived from the standard RC4 algorithm. The proposed method can highly improve security for images transferred over the internet.

3D cipher is a new block cipher proposed by Nakahara at CANS 2008, which operates on 512-bit blocks and 512-bit keys. It has an SPN structure like AES, and employs a 3-dimensional state to enlarge block size and key size. In this paper, we extend the meet-in-the-middle distinguisher to 6 rounds by employing the differential enumeration technique and rebound-like idea, and mount the attack on 11-round 3D with 2497 chosen plaintexts, 2487.5 computations and 2361 memories. By trading some memory for data and time, we can achieve the attack with 2479 chosen plaintexts, 2479.5 computations and 2379 memories.

In cryptography, the Triple DES (3DES, TDES or officially TDEA) is a symmetric-key block cipher which applies the Data Encryption Standard (DES) cipher algorithm three times to each data block. Electronic payment systems are known to use the TDES scheme for the encryption/decryption of data, and hence faster implementations are of great significance. Field Programmable Gate Arrays (FPGAs) offer a new solution for optimizing the performance of applications meanwhile the Triple Data Encryption Standard (TDES) offers a mean to secure information. In this paper we present a pipelined implementation in VHDL, in Electronic Code Book (EBC) mode, of this commonly used cryptography scheme with aim to improve performance. We achieve a 48-stage pipeline depth by implementing a TDES key buffer and right rotations in the DES decryption key scheduler. Using the Altera Cyclone II FPGA as our platform, we design and verify the implementation with the EDA tools provided by Altera. We gather cost and throughput information from the synthesis and timing results and compare the performance of our design to common implementations presented in other literatures. Our design achieves a throughput of 3.2 Gbps with a 50 MHz clock; a performance increase of up to 16 times.

It is necessary for us to evaluate immunity against differential attacks when designing secure block ciphers. Finding the lower bound of active S-boxes is an effective method. Based on MILP, we use an improved method to analyze EPCBC. EPCBC is an ultra-lightweight block cipher. The block size of EPCBC is 48-bit/96-bit and the key size of EPCBC is 96-bit key. EPCBC is fit for EPC encryption. The efficiency of EPCBC results in a huge market application. Hence, it is necessary for us to evaluate the security of EPCBC. In this paper, we show that 32 rounds are secure enough for resisting the differential attacks.

Security for the patient’s information can be achieved by using different encryption algorithms. This paper reviews several encryption methods to gain knowledge about the possible attacks during managing and transmitting the sensitive data. The algorithms are compared to analyze and develop an appropriate encryption algorithm that provides security and integrity to the medical health records, thus the patient’s information remain confidential.

In this study, we propose Heresy, a web application to generate a document that solely exists in the form of a Uniform Resource Locator (URL) fragment. That document is compressed using Lempel-Ziv-Markov algorithm (LZMA) and encrypted using one of four symmetric-key cryptography algorithms: AES, Rabbit, RC4, and Triple DES. This allows a user to create a secured document using markdown markup language, and then share or save the generated URL. In order to view the document, a valid passphrase is needed. All operations are performed in the client machine (serverless). We analyzed the capability and performance of Heresy in several devices to find out the best cryptography algorithm to secure a document.

Many organizations store data to the cloud in a manner that anyone within the organization may share data with a member within the organization or outside the organization. They may also want to restrict data access and the mechanisms to control shared data access. Here a simple, efficient and verified approach to ensure the integrity of data stored in the cloud is proposed. Here, grouping algorithm along with EDAC-MACS is used to provide effective security control with revoking and decryption being more efficient with different algorithms for encryption as well as decryption. In the encryption mechanism a method is introduced which enables metadata generation for verification (signatures). However, consequent to this, the data owner identity is preserved and is not exposed to any other member or user of the cloud. The owners and the users are pushed to different groups without the user or the owner's concern to which policy or which group they belong to. The distinctive feature of this method along with encryption and decryption is that grouping algorithm is used along with EDAC_MACS to provide effective security control and also provides revoking algorithm for users who are suspected. Security analyses prove that this scheme is secure, and experiment results demonstrate that it is efficient.

Cryptography is an indispensable tool for protecting information in computer systems The Advanced Encryption Standard (AES) is one of the cryptography algorithms, which a well-known symmetric key algorithm, that utilizes the same secret key to encrypt and decrypt a message. It defeats that constraint of the more modest enter measure of the Data Encryption Standard (DES) toward using a greater and variable-length way. Moreover, It also determines those moderate preparing speed for triple DES (3DES), also uses more level assets of resources, therefore, it is preferred as the encryption and decryption standard by the U.S. government. AES is now being used worldwide for encrypting advanced information, including financial, telecommunications, and legislature data. In this paper, the AES scheme is implemented on Graphics Processing Unit (GPU) by parallelizing each step in the encryption algorithm of the AES using Compute Unified Device Architecture (CUDA). This allows enhancing the performance of the encryption algorithm execution to achieve a speedup factor of 61.36x on the multicore heterogeneous system.

Failure of deterministic encryption algorithms against various attacks mostly occurs due to the use of fixed and deterministic methods for encrypting, decrypting, and key production. Because the key production in these algorithms is performed functionally and deterministically, there is a relation between the keys and their length that makes the differential analysis of the keys possible. Moreover, the fixed length and values of the keys make these algorithms unsafe against exhaustive key searches. In this study, a block cipher algorithm called indefinite block ciphering based on variable and great length key which belongs to probabilistic (nondeterministic) family is presented. In this algorithm, the key depends on the plain text and is produced indecisively by a random number and the connectivity of the different parameters. On the other hand, the plain text is divided into blocks with size of random number. The proposed algorithm was evaluated, and the results were compared with those of the deterministic and other nondeterministic algorithms. This comparison was indicative of the high performance and security of the new algorithm with respect to the other approaches. Copyright © 2016 John Wiley & Sons, Ltd.