logo
    Reverse iteration encryption scheme using layered cellular automata
    2
    Citation
    0
    Reference
    10
    Related Paper
    Citation Trend
    Abstract:
    A new reverse iterative block encryption scheme using layered cellular automata with T-shaped neighborhood is proposed in this paper. Specifically, based on the T-shaped neighborhood structure, we generate some two order reversible rules and then set the plaintext as the final configuration of a 4-layer CA. Considering the definition of the two order rule, we employ a random sequence as the pre-configuration of the 4-layer CA and keep it as the key with the generated rule, and then backward evolve the CA to get its initial configuration, which is set as the corresponding cipher text. Comprehensive security analysis shows that the proposed scheme is security against statistical, linear and differential cryptanalysis techniques. In addition, the timing analysis demonstrates that the proposed scheme is more efficient than AES algorithm.
    Keywords:
    Plain text
    Sequence (biology)
    With the development of information technology and increasing demands for information security, various encryption methods have been attracted more and more attention in recent years. AES is one such symmetric key algorithm used for securing the data that transmits in the Internet. The strength of AES block cipher depends on the S-Box structure which is a nonlinear substitution operation. S-Boxes are fundamental component of symmetric key algorithms which performs substitution. Since the Substitution boxes are dynamically created, this fact makes it clear that both linear and differential cryptanalysis cannot be done on Dynamic S-Boxes. They are basically used in block ciphers to make the affiliation between key and cipher text more unfamiliar. There are lots of techniques used for generation of S-Box such as key dependent S-Box in which S-Box depends on the key, Bijection, Strict Avalanche criterion etc. This paper briefly analyzes the structure of AES algorithm and a dynamic S-Box is generated based on hash function. Also, the eminence of generated S-Box is been experimentally evaluated and compared along with the original AES for the simulation time.
    S-box
    Key generation
    MDC-2
    The new method of encrypting has been developed. The difference from existing methods is that the identifier of one of the agreed plaintexts (resource files) and the number of the combinatorial permutation of symbols of the indicated resource file is being transmitted, but not the ciphertext. In this connection the developed cryptosystem was named KETA (Key Exist, cipherText Absent). The main idea of the method is based on that any text (plaintext) can be created in the result of permutations of symbols (and also by using some special methods) from any other given text.
    Plain text
    Plaintext-aware encryption
    This paper presents FPGA (field programmable gate array) implementations of ICEBERG, a block cipher designed for reconfigurable hardware implementations and presented at FSE 2004. All its components are involutional and allow very efficient combinations of encryption/decryption. The implementations proposed also allow changing the key and encrypt/decrypt (E/D) mode for every plaintext, without any performance loss. In comparison with other recent block ciphers, the implementation results of ICEBERG show a significant improvement of hardware efficiency. Moreover, the key and E/D agility allows considering new encryption modes to counteract certain side-channel attacks.
    Plain text
    Implementation
    Block size
    Citations (12)
    The order of plaintext is changed by BWT(Burrows-Wheeler Transformation),and the size of ciphertext is reduced by RLE(Run Length Encoding),then XOR operation with keys is executed. This is a data encryption algorithm based on symmetric key,which has strong anti-attack capability.
    Plain text
    Plaintext-aware encryption
    Watermarking attack
    Citations (0)
    At the beginning of 2001 ,the Symmetric Key Block Cipher Modes of Operation Workshop sponsored by NIST plans to develop a new mode standard that will be suitable for other symmetric key block cipher algorithms and AES. This paper summarizes the characteristics and development of the modes presented recently, and makes relevant comment.
    NIST
    Citations (0)
    In this paper a new symmetric cryptographic algorithm which uses new S-boxes during the encryption process is proposed. The cipher ensures high-level of confidentiality due to key-dependent S-boxes. Additionally, a new method of generating S-boxes, one of the basic and commonly used cryptographic function is presented. The method is based on the Rijndael S-box that is currently used in the AES algorithm. Nevertheless, the method is more general and it can be based on any S-box.
    S-box
    Citations (21)
    A known plaintext attack is presented for the Hagelin C-52 and similar machines featuring irregular stepping of the pinwheels. The technique allows the determination of the particular subset of available pinwheels used in the encryption, their order, and the active positions on each pinwheel. Ways of improving the encryption algorithm to defeat the proposed attack are also presented.
    Plain text
    Watermarking attack
    Citations (2)
    Abstract In this paper a fully-automated attack on two XORed plaintext strings is implemented using only knowledge of the statistical properties of the plaintext language. Keywords: Stream cipherkeystreamfrequency distributionautomated cryptanalysisstatisticsVernam cipherone-time pad.
    Plain text
    Citations (47)
    Abstract We studied the symmetric block data encryption algorithm O'zDST 1105:2009 and demonstrated the process of retrieving of secret parameters $ R, d $ using integral analysis (SQUARE-analysis). These parameters are based on the secret key and are used to construct substitution tables of the algorithm. We attacked a truncated version of the algorithm exploiting its vulnerabilities. We demonstrated the importance of a thorough examination of the mutual influence of operations in encryption algorithms.
    Square (algebra)
    Addition Rotation XOR is suitable for fast implementation symmetric –key primitives, such as stream and block ciphers. This paper presents a review of several block and stream ciphers based on ARX construction followed by the discussion on the security analysis of symmetric key primitives where the best attack for every cipher was carried out. We benchmark the implementation on software and hardware according to the evaluation metrics. Therefore, this paper aims at providing a reference for a better selection of ARX design strategy.
    Benchmark (surveying)
    S-box