Rijndael

AES (Advance Encryption Standard) adalah teknik merahasiakan sandi atau data sesuai
standarisasi dari FIPS (Federasi Information Processing Standard) versi 197 dengan menggunakan
algoritma rijndael. AES dibuat oleh kriptografer asal belgia, yakni Vincent Rijmen dan Joan
Daemen menggantikan metode DES (Data Encryption Standard). Untuk pengimplementasian
program, penulis menggunakan bahasa C#.

We introduce the concept of "green cryptography," which adopts the principle of recycling cryptographic design strategies, components, and primitives; in this essay, we'll focus on the AES, and it's underlying block cipher, Rijndael. Cryptographic implementation is met with a mature and minimalist, "do a lot with a little" design paradigm -mature in that it recycles the rigorously cryptanalyzed AES, and its underlying block cipher, Rijndael, and minimalist in that it recycles the AES for both encryption and authentication, via generic composition, where we encrypt then authenticate, separately (e.g., AES-CTR-then-AES-CMAC), or via an integrity-aware confidentiality mode of operation based on generic composition, where encryption then authentication is handled in a single mode (e.g., EAX). The end result is an implementation-centric framework for achieving the strongest notions of confidentiality and integrity, while retaining simplicity within the implementation. In short, recycling-based green cryptography is aimed at sustainable security within scalable implementations. We take a concise look -with an emphasis on symmetric cryptography -at some of the issues that are responsible for why cryptography usually ends up looking bad, in practice, and fails to establish the right threat model, let alone realize it; this is largely due to a lack of cryptographic competence, and the dreaded habit of crammed-in-and-cobbled-together design. To address these issues, we, with the assistance, and comedic relief, of Alice and Bob, give several rules of thumb for sufficient and simplistic cryptographic implementations. Be prepared for a bowl of acronymous porridge, but don't worry; we'll make sure it's as easy to swallow as possible, and it might even up your Scrabble game. So, to the pulpit we go, ready to preach a sermon so desperately in need of being heard, and to which heed should be taken.

A proposed FPGA-based implementation of the Advanced Encryption Standard (AES) algorithm is presented in this paper. This implementation is compared with other works to show the efficiency. The design uses an iterative looping approach with block and key size of 128 bits, lookup table implementation of S -box. This gives low complexity architecture and easily achieves low latency as well as high throughput. Simulation results, performance results are presented and compared with previous reported designs.

Problem statement: Image encryption needs to be secure by resisting statistical attacks and other types of attacks. Approach: The new algorithm, call it the Shuffle Encryption Algorithm (SEA), applies nonlinear s-box byte substitution. Then, it performed a shuffling operation partially dependent on the input data and uses the given key. Results: SEA was implemented and tested with different data, mainly

While it is known previously that the cycle lengths of individual components of the AES round function are very small, we demonstrate here that the cycle length of the S-box combined with the ShiftRow and MixColumn transformation is at least 10 205 . This result is obtained by providing new invariances of the complete AES round function without the key addition. Furthermore, we consider self-duality properties of the AES round function and derive a property analogous to the complementation property of the DES round function. These results confirm the assessments given in other publications that the AES components have several unexpected structural properties.

In this paper, we proposed a new approach for key scheduling algorithm which is an enhancement of the Rijndael key scheduling. This proposed algorithm was developed to improve the weaknesses that has in the Rijndael key schedule. The key schedule function in Rijndael block cipher did not receive the same amount of attention during design phase as the cipher components. Based on our research, there are several properties in key schedule that seemed to violate the design criteria, which was published by NIST, and this has led to many types of attack performed on Rijndael block cipher. Thus we proposed an approach called ShiftColumn, operates by shifting bit and the result will be shifted with different offsets. This transformation is added as the last function after the RCon function. Our new approach improves the security of the original Rijndael key scheduling, by enhancing the bit confusion and diffusion of the subkey, which is output that is produced from the key schedule transformation. The subkeys produced by the proposed approach have been proven to be a better result on both properties compared to the subkeys that were produced from Rijndael key scheduling transformation.

Problem statement: Image encryption needs to be secure by resisting statistical attacks and other types of attacks. Approach: The new algorithm, call it the Shuffle Encryption Algorithm (SEA), applies nonlinear s-box byte substitution. Then, it performed a shuffling operation partially dependent on the input data and uses the given key. Results: SEA was implemented and tested with different data, mainly consisting of images. Results confirmed its security, shown through statistical analysis using histograms, correlation and covariance. Conclusion: New algorithm was suited for encrypting images and other types of data.

This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate algebraic relations. We survey these attacks focusing on their common fundamental principles and on how to avoid them. From this we derive new very general design criteria, applicable for very different cryptographic components. These amount to avoiding (if possible) the existence of, in some sense "too simple" algebraic relations. Though many ciphers that do not satisfy this new paradigm probably still remain secure, the design of ciphers will never be the same again.

Problem statement: Image encryption needs to be secure by resisting statistical attacks and other types of attacks. Approach: The new algorithm, call it the Shuffle Encryption Algorithm (SEA), applies nonlinear s-box byte substitution. Then, it performed a shuffling operation partially dependent on the input data and uses the given key. Results: SEA was implemented and tested with different data, mainly consisting of images. Results confirmed its security, shown through statistical analysis using histograms, correlation and covariance. Conclusion: New algorithm was suited for encrypting images and other types of data.

A real-time video encryption module, developed to be used on an electrical accelerated mini-helicopter (UAV), is presented in this paper. The surveillance system is composed from six modules: image capture, encryption, two radio link modules, decryption and display module. The hart of the encryption system is the CV700C motherboard and it's VIA C7 microprocessor with ultra low power consumption and efficient heat dissipation. For encryption, Rijndael algorithm was used.

Cryptography is one of the most integral components when trying to maintain achieve a secure communication medium and determining the best cryptography algorithm is as important as having a secure communication. In this paper, we will find out the two superlative symmetric cryptography algorithms available and used nowadays. Then, observe which algorithm is better than the other and finally give some recommendations based on the results achieved. This will surely narrow down the options as to which algorithm to choose when trying to achieve a secure communication.

Implementation in one FPGA of the AES-Rijndael in Offset Codebook (OCB) and Electronic Codebook (ECB) modes of operation was developed and experimentally tested using the Insight Development Kit board, based on Xilinx Virtex II XC2V1000-4 device. The circuit was designed to provide simultaneous data privacy and authenticity in applications which require small area such as wireless LANs, cellular phones, and

Cache attacks exploit side-channel information that is leaked by a microprocessor's cache. There has been a significant amount of research effort on the subject to analyze and identify cache side-channel vulnerabilities since early 2002. Experimental results support the fact that the effectiveness of a cache attack depends on the particular implementation of the cryptosystem under attack and on the cache architecture of the device this implementation is running on. Yet, the precise effect of the mutual impact between the software implementation and the cache architecture is still an unknown. In this manuscript, we explain the effect and present an analytical model for time-driven cache attacks that accurately forecasts the strength of a symmetric key cryptosystem based on 3 simple parameters: (1) the number of lookup tables; (2) the size of the lookup tables; (3) and the length of the microprocessor's cache line. The accuracy of the model has been experimentally verified on 3 different platforms with different implementations of the AES algorithm attacked by adversaries with different capabilities.

By means of this study We have optimized the performance of the cryptographic algorithm Rijndael in a low cost hardware/software system, in a FPGA Spartan3e board of Xilinx with a MicroBlaze soft-processor. After the study of its execution in six systems with different configurations, the hardware bits rotation of MicroBlaze's optimizes the process of coding and deciphered, and the combination with the implementation of a coprocesador with a Galois field multiplier optimizes the key expansion.

AES advanced encryption standard algorithm was designed to resist classical methods of cryptanalysis (e.g. linear or differential attacks), which were based on probabilistic characteristics. But, it has not mature immunity against algebraic attacks which becomes more powerful after the emergence of XSL algorithm. In this research we tried some methods to increase the immunity of AES algorithm against these algebraic

Abstract. Several recently proposed ciphers, for example Rijndael and Serpent, are built with layers of small S-boxes interconnected by linear key-dependent layers. Their security relies on the fact, that the classical methods of cryptanalysis (eg linear or differential attacks) are ...

In this paper we generalize the structure of the ciphers Shark, Square, BKSQ, Crypton and Rijndael. We show that the linear components play an essential role in the effect of the nonlinear S-boxes in providing resistance against differential and linear cryptanalysis and provide upper bounds for the probability of differential characteristics and the correlation of linear approximations for the general structure. We show how good linear components can be constructed efficiently from Maximum-Distance Separable codes. The presented block cipher structure can make optimal use of a wide range of processor word lengths and its parallelism allows very fast dedicated hardware implementations. Ciphers with variable block length can be constructed by varying certain parameters in the presented structure.

This paper presents two algorithms for solving the linear and the affine equivalence problem for arbitrary permutations (S-boxes). For a pair of n × n-bit permutations the complexity of the linear equivalence algorithm (LE) is O(n 3 2 n). The affine equivalence algorithm (AE) has complexity O(n 3 2 2n). The algorithms are efficient and allow to study linear and affine equivalences for bijective S-boxes of all popular sizes (LE is efficient up to n ≤ 32). Using these tools new equivalent representations are found for a variety of ciphers: Rijndael, DES, Camellia, Serpent, Misty, Kasumi, Khazad, etc. The algorithms are furthermore extended for the case of non-bijective n to m-bit S-boxes with a small value of |n − m| and for the case of almost equivalent S-boxes. The algorithms also provide new attacks on a generalized Even-Mansour scheme. Finally, the paper defines a new problem of S-box decomposition in terms of Substitution Permutations Networks (SPN) with layers of smaller S-boxes. Simple information-theoretic bounds are proved for such decompositions.

This article describes the implementation methodology of Rijndael algorithm to encryption process, by using asynchronous design with assistance of the software tool Balsa, for functional simulation, description and synthesis of asynchronous digital circuits. The main results presented correspond to implementations that use the codification protocols dual-rail and 1-of-4, for blocks of data and keys of 128 bits over a field-programmable gate array (FPGA) hardware platform. The Xilinx ISE tool was used showing a full integration level with the Balsa system.

Cache attacks exploit side-channel information that is leaked by a microprocessor's cache. There has been a significant amount of research effort on the subject to analyze and identify cache side-channel vulnerabilities since early 2002. Experimental results support the fact that the effectiveness of a cache attack depends on the particular implementation of the cryptosystem under attack and on the cache architecture of the device this implementation is running on. Yet, the precise effect of the mutual impact between the software implementation and the cache architecture is still an unknown. In this manuscript, we explain the effect and present an analytical model for time-driven cache attacks that accurately forecasts the strength of a symmetric key cryptosystem based on 3 simple parameters: (1) the number of lookup tables; (2) the size of the lookup tables; (3) and the length of the microprocessor's cache line. The accuracy of the model has been experimentally verified on 3 different platforms with different implementations of the AES algorithm attacked by adversaries with different capabilities.

Universal mobile telecommunication system (UMTS) has specified security mechanisms with extra features compared to the security mechanisms of previous mobile communication systems (GSM, DECT). A hardware implementation of the UMTS security mechanism is presented in this paper. The proposed VLSI system supports the Authentication and Key Agreement procedure (AKA), the data confidentiality procedure, and the integrity protection procedure. The AKA procedure is based on RIJNDAEL Block Cipher. An efficient RIJNDAEL architecture is proposed in order to minimize the usage of hardware resources. The proposed implementation performs the AKA procedure within 76 ms comparing with the 500 ms that UMTS specifies. The data confidentiality and the integrity protection is based on KASUMI Block Cipher. The proposed KASUMI architecture reduces the hardware resources and power consumption. It uses feedback logic and positive-negative edge-triggered pipeline in order to make the critical path shorter, without increasing the execution latency. The S-BOXes that are used from RIJNDAEL and KASUMI block ciphers have been implemented with combinational logic as well as with ROM blocks.

In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the important feature that no low-weight characteristics form collisions, and at the same time it limits access to the state. We propose two concrete hash functions, Grindahl-256 and Grindahl-512 with claimed security levels with respect to collision, preimage and second preimage attacks of 2 128 and 2 256 , respectively. Both proposals have lower memory requirements than other hash functions at comparable speeds and security levels.