Showing papers on "Round function published in 2007"
Patent•
25 Oct 2007TL;DR: In this paper, an arithmetic method and apparatus for supporting Advanced Encryption Standard (AES) and Academy, Research Institute and Agency (ARIA) encryption/decryption functions are presented.
Abstract: Provided are an arithmetic method and apparatus for supporting Advanced Encryption Standard (AES) and Academy, Research Institute and Agency (ARIA) encryption/decryption functions. The apparatus includes: a key scheduler for generating a round key using an input key; and a round function calculator for generating encrypted/decrypted data using input data and the round key. Here, the round function calculator includes an integrated substitution layer and an integrated diffusion layer capable of performing both AES and ARIA algorithms.
9 citations
Patent•
04 May 2007
TL;DR: A cryptographic state update process uses both cyclic preceding and cyclic following blocks as inputs into a round function as mentioned in this paper, where the following blocks are used to update the state of the system.
Abstract: A cryptographic state update process uses both cyclic preceding and cyclic following blocks as inputs into a round function.
5 citations
TL;DR: The FDE structure and an algorithm to construct a set of strong S- boxes are presented and eight suitable S-boxes from this set are suggested for use with FDE.
Abstract: Fast Data Encryption (FDE) is a new symmetric block cipher which has a DES-like structure. FDE has been designed with an increased key length, increased key scheduling complexity and an improved round function which can be executed in parallel. FDE uses eight Substitution Boxes (S-boxes) in the round function to provide confusion. In this paper, we present the FDE structure and an algorithm to construct a set of strong S-boxes. Eight suitable S-boxes from this set are suggested for use with FDE.
4 citations
Journal Article•
TL;DR: To evaluate the security of a class of generalized Feistel ciphers,the security analysis against differential and linear attacks was investigated deeply using enumeration method.
Abstract: To evaluate the security of a class of generalized Feistel ciphers,the security analysis against differential and linear attacks was investigated deeply using enumeration method.If the round function is bijective,then the number of active round function for 4,8,12,16-round ciphers are not less than 2,5,8,10 respectively and the number of active round function for 4r-round(r≥2) ciphers are not less than 2r+1.So the upper bounds of maximum differential and linear characteristic probabilities for 4r-round ciphers are p2r+1 and q2r+1 if maximum differential and linear approximation probabilities for round function are p and q.
3 citations