The Experts below are selected from a list of 6960 Experts worldwide ranked by ideXlab platform

Lekshmi R. Nair - One of the best experts on this subject based on the ideXlab platform.

  • Data based Transposition to Enhance Data Avalanche and Differential Data Propagation in advanced encryption standard
    2014
    Co-Authors: Paul A. J, Saju A, Lekshmi R. Nair
    Abstract:

    In symmetric block ciphers, substitution and transposition operations are performed in multiple rounds to transform plaintext blocks into ciphertext blocks. In advanced encryption standard (AES) the transposition of data is facilitated by shift row and mix column operations. In Matrix Array Symmetric Key (MASK) encryption, a block cipher proposed by the author, the data transposition is achieved by data based rotations. The data based transposition procedure offers two advantages. First, it is simple to implement and secondly, the procedure produces a strong data avalanche effect and differential data propagation. In this paper the possibility of improvising the performance of AES using data based transposition in its diffusion rounds is examined. As a case study, the data based transposition procedure has been introduced in AES. The data avalanche and differential data propagation produced in AES have been observed. The paper describes the data based transposition procedure and the enhanced data avalanche and differential data propagation produced in AES. It has been shown that, the data avalanche effect and differential data propagation characteristics of AES have been improved

  • data based transposition to enhance data avalanche and differential data propagation in advanced encryption standard
    International Journal of Computer Applications, 2013
    Co-Authors: A J Paul, A Saju, Lekshmi R. Nair
    Abstract:

    In symmetric block ciphers, substitution and transposition operations are performed in multiple rounds to transform plaintext blocks into ciphertext blocks. In advanced encryption standard (AES) the transposition of data is facilitated by shift row and mix column operations. In Matrix Array Symmetric Key (MASK) encryption, a block cipher proposed by the author, the data transposition is achieved by data based rotations. The data based transposition procedure offers two advantages. First, it is simple to implement and secondly, the procedure produces a strong data avalanche effect and differential data propagation. In this paper the possibility of improvising the performance of AES using data based transposition in its diffusion rounds is examined. As a case study, the data based transposition procedure has been introduced in AES. The data avalanche and differential data propagation produced in AES have been observed. The paper describes the data based transposition procedure and the enhanced data avalanche and differential data propagation produced in AES. It has been shown that, the data avalanche effect and differential data propagation characteristics of AES have been improved. General Terms encryption Algorithm, Diffusion Round, Symmetric Block Cipher, Cryptographic Transformation.

V Piuri - One of the best experts on this subject based on the ideXlab platform.

  • error analysis and detection procedures for a hardware implementation of the advanced encryption standard
    IEEE Transactions on Computers, 2003
    Co-Authors: Guido Bertoni, L Breveglieri, Israel Koren, P Maistri, V Piuri
    Abstract:

    The goal of the advanced encryption standard (AES) is to achieve secure communication. The use of AES does not, however, guarantee reliable communication. Prior work has shown that even a single transient error occurring during the AES encryption (or decryption) process will very likely result in a large number of errors in the encrypted/decrypted data. Such faults must be detected before sending to avoid the transmission and use of erroneous data. Concurrent fault detection is important not only to protect the encryption/decryption process from random faults. It will also protect the encryption/decryption circuitry from an attacker who may maliciously inject faults in order to find the encryption secret key. In this paper, we first describe some studies of the effects that faults may have on a hardware implementation of AES by analyzing the propagation of such faults to the outputs. We then present two fault detection schemes: The first is a redundancy-based scheme while the second uses an error detecting code. The latter is a novel scheme which leads to very efficient and high coverage fault detection. Finally, the hardware costs and detection latencies of both schemes are estimated.

  • a parity code based fault detection for an implementation of the advanced encryption standard
    Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2002
    Co-Authors: Guido Bertoni, L Breveglieri, Israel Koren, P Maistri, V Piuri
    Abstract:

    Concurrent fault detection for a hardware implementation of the advanced encryption standard (AES) is important not only to protect the encryption/decryption process from random faults. It will also protect the encryption/decryption circuitry from an attacker who may maliciously inject faults in order to find the encryption secret key. In this paper we present a novel fault detection scheme which is based on a multiple parity bit code and show that the proposed scheme leads to very efficient and high coverage fault detection. We then estimate the associated hardware costs and detection latencies.

  • on the propagation of faults and their detection in a hardware implementation of the advanced encryption standard
    Application-Specific Systems Architectures and Processors, 2002
    Co-Authors: Guido Bertoni, L Breveglieri, Israel Koren, P Maistri, V Piuri
    Abstract:

    High reliability is a desirable property of any implementation of the advanced encryption standard (AES). To achieve high reliability, all possible faults must be detected to avoid the use and transmission of erroneous encrypted/decrypted data. In this paper we first study the behavior of faults which may occur during the encryption and decryption procedures of AES, and the way such faults eventually propagate to the final result. We then describe an appropriate detection technique for these faults. This work extends our preliminary results (G. Bertoni et al, MPCS 2002) by considering more general fault models (e.g., permanent and multiple transient faults), and the possibility of fault masking.

Raphael C W Phan - One of the best experts on this subject based on the ideXlab platform.

  • impossible differential cryptanalysis of 7 round advanced encryption standard aes
    Information Processing Letters, 2004
    Co-Authors: Raphael C W Phan
    Abstract:

    In 2000, Biham and Keller [Cryptanalysis of reduced variants of Rijndael, 3rd AES Conference, in press] presented an impossible differential cryptanalysis of the advanced encryption standard (AES) up to 5 rounds. This was later improved in 2001 by Cheon et al. [Improved impossible differential cryptanalysis of Rijndael and Crypton, in: Lecture Notes in Comput. Sci., vol. 2288, Springer-Verlag, Berlin, 2001, pp. 39-49] to apply to 6 rounds of the AES. In this paper, we extend on previous results to present an attack on the AES up to 7 rounds. This is the best-known impossible differential attack on the AES, and works by exploiting weaknesses in the AES key schedule.

  • mini advanced encryption standard mini aes a testbed for cryptanalysis students
    Cryptologia, 2002
    Co-Authors: Raphael C W Phan
    Abstract:

    In this paper, we present a mini version of Rijndael, the symmetric-key block cipher selected as the advanced encryption standard (AES) recently. Mini-AES has all the parameters significantly reduced while at the same time preserving its original structure. It is meant to be a purely educational cipher and is not considered secure for actual applications. The purpose is such that once undergraduate students and amateur cryptanalysts have grasped the basic principles behind how Mini-AES works, it will be easy for them to move on to the real AES. At the same time, an illustration of how the Square attack can be applied to Mini-AES is presented in the hope that Mini-AES would also serve as a testbed for students to begin their cryptanalysis efforts.

  • generalised impossible differentials of advanced encryption standard
    Electronics Letters, 2001
    Co-Authors: Raphael C W Phan, Mohammad Umar Siddiqi
    Abstract:

    A class of generalised four-round impossible differentials of the advanced encryption standard is presented and shown to be the best that can be obtained with the miss-in-the-middle technique.

Lawrence E Bassham - One of the best experts on this subject based on the ideXlab platform.

  • Report on the Development of the advanced encryption standard (AES).
    Journal of research of the National Institute of Standards and Technology, 2001
    Co-Authors: James R. Nechvatal, W E Burr, Lawrence E Bassham, Elaine B. Barker, Morris J. Dworkin, James Foti, E Roback
    Abstract:

    In 1997, the National Institute of standards and Technology (NIST) initiated a process to select a symmetric-key encryption algorithm to be used to protect sensitive (unclassified) Federal information in furtherance of NIST’s statutory responsibilities. In 1998, NIST announced the acceptance of fifteen candidate algorithms and requested the assistance of the cryptographic research community in analyzing the candidates. This analysis included an initial examination of the security and efficiency characteristics for each algorithm. NIST reviewed the results of this preliminary research and selected MARS, RC6™, Rijndael, Serpent and Twofish as finalists. Having reviewed further public analysis of the finalists, NIST has decided to propose Rijndael as the advanced encryption standard (AES). The research results and rationale for this selection are documented in this report.

  • randomness testing of the advanced encryption standard finalist candidates
    NIST Interagency Internal Report (NISTIR) - 6483, 2000
    Co-Authors: Juan Soto, Lawrence E Bassham
    Abstract:

    Abstract : Mars, RC6, Rijndael, Serpent and Twofish were selected as finalists for the advanced encryption standard (AES). To evaluate the finalists' suitability as random number generators, empirical statistical testing is commonly employed. Although it is widely believed that these five algorithms are indeed random, randomness testing was conducted to show that there is empirical evidence supporting this belief. In this paper, NIST reports on the studies that were conducted on the finalists for the 192-bit key size and 256-bit key size. The results to date suggest that all five of the finalists appear to be random.

  • efficiency testing of ansi c implementations of round 2 candidate algorithms for the advanced encryption standard
    World Wide Web, 1999
    Co-Authors: Lawrence E Bassham
    Abstract:

    The evaluation criteria for the advanced encryption standard (AES) Round2 candidate algorithms, as specified in the “Request for Comments” [1], includes computational efficiency, among other criteria. Specifically, the “Call For AES Candidate Algorithms” [2] required both Reference ANSI C code and Optimized ANSI C code, as well as Java code. Additionally, a “reference” hardware and software platform was specified for testing. NIST performed testing on this reference platform, as well as several others. Candidate algorithms were tested for computational efficiency using the Optimized ANSI C source code provided by the submitters.

Guido Bertoni - One of the best experts on this subject based on the ideXlab platform.

  • error analysis and detection procedures for a hardware implementation of the advanced encryption standard
    IEEE Transactions on Computers, 2003
    Co-Authors: Guido Bertoni, L Breveglieri, Israel Koren, P Maistri, V Piuri
    Abstract:

    The goal of the advanced encryption standard (AES) is to achieve secure communication. The use of AES does not, however, guarantee reliable communication. Prior work has shown that even a single transient error occurring during the AES encryption (or decryption) process will very likely result in a large number of errors in the encrypted/decrypted data. Such faults must be detected before sending to avoid the transmission and use of erroneous data. Concurrent fault detection is important not only to protect the encryption/decryption process from random faults. It will also protect the encryption/decryption circuitry from an attacker who may maliciously inject faults in order to find the encryption secret key. In this paper, we first describe some studies of the effects that faults may have on a hardware implementation of AES by analyzing the propagation of such faults to the outputs. We then present two fault detection schemes: The first is a redundancy-based scheme while the second uses an error detecting code. The latter is a novel scheme which leads to very efficient and high coverage fault detection. Finally, the hardware costs and detection latencies of both schemes are estimated.

  • a parity code based fault detection for an implementation of the advanced encryption standard
    Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2002
    Co-Authors: Guido Bertoni, L Breveglieri, Israel Koren, P Maistri, V Piuri
    Abstract:

    Concurrent fault detection for a hardware implementation of the advanced encryption standard (AES) is important not only to protect the encryption/decryption process from random faults. It will also protect the encryption/decryption circuitry from an attacker who may maliciously inject faults in order to find the encryption secret key. In this paper we present a novel fault detection scheme which is based on a multiple parity bit code and show that the proposed scheme leads to very efficient and high coverage fault detection. We then estimate the associated hardware costs and detection latencies.

  • on the propagation of faults and their detection in a hardware implementation of the advanced encryption standard
    Application-Specific Systems Architectures and Processors, 2002
    Co-Authors: Guido Bertoni, L Breveglieri, Israel Koren, P Maistri, V Piuri
    Abstract:

    High reliability is a desirable property of any implementation of the advanced encryption standard (AES). To achieve high reliability, all possible faults must be detected to avoid the use and transmission of erroneous encrypted/decrypted data. In this paper we first study the behavior of faults which may occur during the encryption and decryption procedures of AES, and the way such faults eventually propagate to the final result. We then describe an appropriate detection technique for these faults. This work extends our preliminary results (G. Bertoni et al, MPCS 2002) by considering more general fault models (e.g., permanent and multiple transient faults), and the possibility of fault masking.