Formal Specification and Verification of Fully Asynchronous Implementations of the Data Encryption Standard

File-sharing activities become a bridge for communication in the form of data between one party and another party. File sharing allows users to share data with other users, by uploading data to the server computer and other users can download data from the server computer. A document security system is indispensable to keep document data safe until its destination. File Web Sharing will transmit data with cryptographic methodologies. The algorithm used is Advanced Encryption Standard (AES), Data Encryption Standard (DES), and Blowfish. This study aims to compare the performance of AES, DES, and Blowfish algorithms when implemented to secure file sharing. Performance research results show that the DES algorithm is on average 8.35% faster than AES and the Blowfish algorithm is 7.11% faster than AES. Memory usage capacity testing shows that the AES algorithm requires 4.82% greater memory capacity than Blowfish, and the DES requires 2.41% greater memory capacity than the Blowfish algorithm. Kegiatan file sharing menjadi jembatan komunikasi data antara satu pihak dengan pihak lainnya. File sharing memberikan pengguna kemampuan untuk berbagi data dengan pengguna lain, dengan cara mengunggah data ke komputer server dan pengguna lain dapat mengunduh data dari komputer server. Sistem keamanan terhadap dokumen sangat diperlukan untuk menjaga data dokumen tetap aman sampai tujuannya. Web File Sharing akan mengirimkan data dengan metodologi kriptografi. Algoritma yang digunakan adalah Advanced Encryption Standard (AES), Data Encryption Standard (DES), dan Blowfish. Penelitian ini bertujuan untuk membandingkan kinerja algoritma AES, DES dan Blowfish saat diimplementasikan untuk mengamankan file sharing. Hasil pengujian kinerja menunjukkan bahwa algoritma DES rata-rata 8,35% lebih cepat dibandingkan AES sedangkan Blowfish 7,11% lebih cepat dibandingkan AES. Berdasarkan pengujian kapasitas penggunaan memori terlihat bahwa AES membutuhkan kapasitas memori 4,82% lebih besar dibandingkan Blowfish dan DES membutuhkan kapasitas memori 2,41% lebih besar dari Blowfish.

The Data Encryption Standard (DES) was a prevalent symmetric key block cipher scheme. It was the most popular used cryptographic algorithm. DES's security was a highly debatable aspect until it became an insecure algorithm in 1999. In this paper, an enhancement that overcomes the security weakness of DES is introduced. The modification employs the chaotic logistic map and the art of the Elliptic Curve Cryptography. The required key generation and distribution are achieved by the enhancement to establish a communication session. Our new DES is applied on image encryption and decryption processes. Experimental results are carried out with detailed analyses, the results demonstrate that the proposed scheme has an absolutely large key space to encounter the brute-force attack and it has a good immunity to the statistical attacks. Accordingly the introduced new DES algorithm could be used as a remarkably secure algorithm.

Data security is the focus of information security. As a primary method, file encryption is adopted for ensuring data security. Encryption algorithms created to meet the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES) are widely used in a variety of systems. These algorithms are computationally highly complex, thus, the efficiency of encrypting or decrypting large files can be drastically reduced. To this end, we propose an optimized algorithm that efficiently encrypts and decrypts large files by parallelizing processing tasks on a single heterogeneous many-core processor in the Sunway TaihuLight computer system. Firstly, we convert the serial DES and AES programs to our experimental platform. Then we implement a task assignment strategy to test the converted algorithms. Finally, in order to optimize parallelized algorithms and improve data transmission performance, we apply the master-slave communication optimization, the three-stage parallel pipeline, and vectorization. Extensive experiments demonstrate that our optimized algorithm is faster than the state-of-the-art open-source implementations of DES and AES. Compared with the serial processing algorithms, our parallelized DES and AES perform nearly 40 times and 72 times faster, respectively. The work described in this paper leverages existing methods and provides a sound basis for the direction of future research in data encryption.

Data Encryption Standard (DES) is the most widely used symmetric-key algorithm for encryption algorithm. Different attacks like brute force and cryptanalysis attack can be used to break DES due to its small key size and simple and uniform distribution XOR operation. With the issues mentioned above, this paper proposes modification to enhance DES against these various attacks. The proposed enhancement used f-function by incorporating striding techniques instead of just performing the XOR operation between 56- bit sub key and the plaintext. The security against the known exhaustive attack and cryptanalysis attack was enhanced. The enhanced DES have been evaluated and compared against original DES using avalanche effect. Enhanced DES resulted to an average of avalanche effect of 55% due to one-bit vibration in plaintext.

High-capability electronics systems for a compact, battery-operated computer: Brooke, E, Livengood, R J, Smith, R C and Myers, T FHewlett-Packard J. Vol 34 No 6 (June 1983) p 10

Late detection of errors in hardware designs usually results in great costs. On the other hand, the growing advances on this field has let the complexity level to increase extensively. The problem is that the typical Hardware Description Languages (HDL) like VHDL and Verilog are made for synthesis and simulation only. But, the simulation technique could be deficient in complex designs such as the cryptographic circuits. Formal verification has became an important technique towards establishing the correctness of hardware designs. This paper presents a formal verification approach for the cryprographic circuits. It consists on using the functional language Haskell to formally describe both the behavioral and the structural descriptions. In addition, it relies on the use of the hierarchy and modularity techniques in order to reduce the complexity of the designs; and hence simplify the verification task. To show the potential features of the proposed approach, it is applied to the Data Encryption Standard (DES) circuit and its formal specification is presented.

The paper mainly discusses the integrity of the forwarded subscription message guaranteed by secure channel which encrypted in data communication by using data encryption standard (DES) algorithm and chaos code algorithm between broker nodes in the routing process of the content-based publish/subscribe system. It analyzes the security of the secure channel encrypted with data communication by DES algorithm and chaos code algorithm, and finds out the secure channel can be easily attacked by known plain text. Therefore, the paper proposes the improved algorithm of message encryption and authentication, combining encryption and the generation of the message authentication code together to finish scanning at one time, which enhances both the secure degree and running efficiency. This secure channel system has a certain reference value to the pub/sub system requiring highly communication security.

The data encryption standard (DES) is an algorithm with approximate 72 quadrillion possible keys. The security of the DES is based on the difficulty of picking out the right key after the 16-round nonlinear function operations. In this paper, we propose a concrete recursive sticker molecular algorithm to the DES. The molecular sticker algorithm includes three parts: initializing the key space with all possible keys, encryption and detecting the corresponding key. The essential operations required in DES are implemented by the molecular sticker functions. The short memory strands, tubes, enzymes needed by the molecular sticker algorithm are calculated and analyzed. Furthermore, this work indicates that the DES are perhaps insecure and also presents clear evidence of the ability of molecular computing to perform complicated operations.

This paper describes two high-performance reconfigurable hardware implementations of the Data Encryption Standard (DES) algorithm. This is achieved by combining pipelining concept with time-variable key technique. The two proposed schemes change the key with time. The first one uses a counter to change the key every clock cycle. The second changes the key using a pseudorandom number generator. Using time-variable key technique enhances the security of DES because the same plaintext is ciphered to different cipher texts by time. Hackers will face difficulty to hack into the proposed schemes because of time-variant behavior. Final 16-stage pipelined design of the two proposed schemes is implemented on Xilinx Spartan-3e Field Programmable Gate Array (FPGA) technology. The 16-stage pipelined design of the first scheme is achieved with encryption rate of 7.97 Gbit/s and 2697 number of Configurable logic blocks (CLBs). The second operates at data rates up to 7.26 Gbit/s and 2566 CLBs. The two proposed hardware designs are more secure than any previous hardware design and among the fastest implementations with better area utilization.

A high-speed data encryption chip implementing the Data Encryption Standard (DES) has been developed. The DES modes of operation supported are Electronic Code Book and Cipher Block Chaining. The chip is based on a gallium arsenide (GaAs) gate array containing 50K transistors. At a clock frequency of 250 MHz, data can be encrypted or decrypted at a rate of 1 GBit/second, making this the fastest single-chip implementation reported to date. High performance and high density have been achieved by using custom-designed circuits to implement the core of the DES algorithm. These circuits employ precharged logic, a methodology novel to the design of GaAs devices. A pipelined flow-through architecture and an efficient key exchange mechanism make this chip suitable for low-latency network controllers.KeywordsData Encryption StandardProgrammable Logic ArrayCipher Block ChainPlaintext BlockInitial PermutationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Tamper-resistant software which implements a block cipher with a fixed embedded cryptographic key is important for securing embedded systems for digital rights management, access control, and other applications. The security of such software is measured by its ability to hide the embedded key against numerous known attacks. A class of methods for constructing tamper-resistant software by using a number of look-up tables is called a white-box implementation or table-network implementation. We developed a method of evaluating the security of table-network implementations of the Data Encryption Standard (DES). Link and Neumann proposed a table-network implementation of DES that is claimed to be resistant against all known attacks, which are effective for table-network implementations of DES proposed by Chow, Eisen, Johnson, and van Oorschot. In this paper, we point out the existence of a new attack, which allows efficient extraction of the hidden key in the Link-Newman table-network implementation of DES. Our result should contribute in completing the list of attacking methodologies and thus help the design of better tamper-resistant software.

In the paper we use recently proposed cellular automata (CA) based methodology (Szaban and Seredynski in LNCS, vol. 5191, pp. 478---485, 2008) to design the 6×4 S-boxes functionally equivalent to S-boxes used in current cryptographic standard known as Data Encryption Standard (DES). We provide an exhaustive experimental analysis of the proposed CA-based S-boxes in terms of non-linearity, autocorrelation, balance and strict avalanche criterion, and compare results with ones corresponding to DES S-boxes. We show that the proposed CA-based S-boxes have cryptographic properties comparable to or better than classical S-box tables. The interesting feature of the proposed S-boxes is a dynamic flexible structure fully functionally realized by CA, while the classical DES S-boxes are represented by predefined unchangeable table structures.

Nowadays, Internet and multimedia is popularly growing fast and is being used in digital communication. With increase in demand, risks are also involved. Thus, digital watermarking is an absolute method to provide authentication and copyright protection to the digital media to protect it from illegal modification and redistribution. In this paper, we have proposed a robust watermarking algorithm using DES, ECC and DCT for color images. The original color image (watermark) and cover image has been separated into three independent color channels (red, green and blue) and their gray scale equivalents are used. Each individual gray scale equivalent of RGB components of original image has been encrypted using Data Encryption Standard (DES). The Henon map is used to generate three different round keys for DES with different initial parameters. After encrypting three different gray scale equivalents, the encrypted images are mapped to the points of elliptic curve. The mapped images so formed are embedded in different gray scale equivalents of RGB components of color image using DCT. The mapped images are hidden into the mid frequency of DCT blocks to avoid it from common attacks. The effectiveness and robustness of the algorithm is shown in the experiments.

<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>

Limitations of storage sources is one option to switch to cloud storage. Confidentiality and security of data stored on the cloud is very important. To keep up the confidentiality and security of such data can be done one of them by using cryptography techniques. Data Encryption Standard (DES) is one of the block cipher algorithms used as standard symmetric encryption algorithm. This DES will produce 8 blocks of ciphers combined into one ciphertext, but the ciphertext are weak against brute force attacks. Therefore, the last 8 block cipher will be converted into 8 random images using Least Significant Bit (LSB) algorithm which later draws the result of cipher of DES algorithm to be merged into one.