Scribd Logo
Upload

Welcome to Scribd!

  • 124 views

    tp2 151101134027 Lva1 App6892

    Uploaded by

    naman
    AES is an encryption standard chosen by NIST to protect classified information. It operates on 128-bit blocks using 10, 12, or 14 rounds of processing depending on the key size of 128, 192, or 256 bits. The AES algorithm involves four main steps - substitution, shifting rows of data, mixing data between columns, and adding the round key - to encrypt and decrypt information. While brute force attacks are theoretically possible, exhaustive key searching or related key attacks on AES-128 and AES-256 are currently considered infeasible with modern computing capabilities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    tp2 151101134027 Lva1 App6892

    Uploaded by

    naman
    124 views22 pages
    AES is an encryption standard chosen by NIST to protect classified information. It operates on 128-bit blocks using 10, 12, or 14 rounds of processing depending on the key size of 128, 192, or 256 bits. The AES algorithm involves four main steps - substitution, shifting rows of data, mixing data between columns, and adding the round key - to encrypt and decrypt information. While brute force attacks are theoretically possible, exhaustive key searching or related key attacks on AES-128 and AES-256 are currently considered infeasible with modern computing capabilities.

    Original Description:

    jjjjlop

    Original Title

    tp2-151101134027-lva1-app6892

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    AES is an encryption standard chosen by NIST to protect classified information. It operates on 128-bit blocks using 10, 12, or 14 rounds of processing depending on the key size of 128, 192, or 256 bits. The AES algorithm involves four main steps - substitution, shifting rows of data, mixing data between columns, and adding the round key - to encrypt and decrypt information. While brute force attacks are theoretically possible, exhaustive key searching or related key attacks on AES-128 and AES-256 are currently considered infeasible with modern computing capabilities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    124 views22 pages

    tp2 151101134027 Lva1 App6892

    Uploaded by

    naman
    AES is an encryption standard chosen by NIST to protect classified information. It operates on 128-bit blocks using 10, 12, or 14 rounds of processing depending on the key size of 128, 192, or 256 bits. The AES algorithm involves four main steps - substitution, shifting rows of data, mixing data between columns, and adding the round key - to encrypt and decrypt information. While brute force attacks are theoretically possible, exhaustive key searching or related key attacks on AES-128 and AES-256 are currently considered infeasible with modern computing capabilities.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 22

    Advanced Encryption Standard

    (AES)

    Prince Rachit Sinha


    What is Cryptography?

    Cryptography is the art of protecting


    information by transforming the original
    message, called plaintext into an encoded
    message, called a cipher or ciphertext.

    ABC (meaningful message)-> ZYX(cipher)


    What is AES?
    AES is an encryption standard chosen by the
    National Institute of Standards and
    Technology(NIST), USA to protect classified
    information. It has been accepted world wide as
    a desirable algorithm to encrypt sensitive data.
    It is a block cipher which operates on block size
    of 128 bits for both encrypting as well as
    decrypting.
    Each Round performs same operations.
    Why AES?
    In 1990's the cracking of DES algorithm became possible.
    Around 50hrs of bruteforcing allowed to crack the
    message.
    NIST started searching for new feasible algorithm and
    proposed its requirement in 1997.
    In 2001 Rijndael algorithm designed by Rijment and
    Daemon of Belgium was declared as the winner of the
    competition.
    It met all Security, Cost and Implementation criteria.
    How Does it works?
    AES basically repeats 4 major functions to encrypt
    data.It takes 128 bit block of data and a key[laymans
    term password] and gives a ciphertext as output.The
    functions are:

    I. Sub Bytes
    II.Shift Rows
    III.Mix Columns
    IV.Add Key
    How Does it works?
    The number of rounds performed by the algorithm strictly depends on
    the size of key.
    The following table gives overview of no. Of rounds performed with
    the input of varying key lengths:

    Key Size(in bits) Rounds


    128.................................................10
    192.................................................12
    256.................................................14
    The larger the number of keys the more secure will be the data.
    The time taken by s/w to encrypt will increase with no. of rounds.
    How Does it works?

    E(m,k) D(n,k)
    n(128bits) n(128bits) m(128bits)
    m(128bits)
    E D

    k k

    Here, E=encryption function for a symmetric block cipher


    m=plaintext message of size 128bits
    n=ciphertext
    k=key of size 128bits which is same for both encryption and decryption
    D= Decryption function for symmetric block cipher
    Steps for encryption and decryption
    Analysis of Steps
    KeyExpansions- In the key Expansion process the given 128
    bits cipher key is stored in [4]x[4] bytes matrix (16*8=128 bits)
    and then the four column words of the key matrix is expanded
    into a schedule of 44 words (44*4=176) resulting in 11 round
    keys (176/11=16 bytes or 128 bits).
    Number of round keys = Nr + 1. Where Nr is the number of
    rounds (which is 10 in case of 128 bits key size) So here the
    round keys = 11.
    Analysis of Steps
    Analysis of Steps
    SubBytes- Each element of the matrix is
    replaced by the an element of s-box matrix.
    Analysis of Steps
    SubBytes
    For an element {d1} corresponding value is {3e}

    Rijndael S-box
    Analysis of Steps
    SubBytes
    The S-box is a special lookup table which is
    constructed by Galois fields.
    The Generating function used in this algorithm
    is GF(2^8)
    i.e. 256 values are possible
    The elements of the sbox are written in
    hexadecimal system
    Analysis of Steps
    Shift Rows
    In this step rows of the block are cylindrically
    shifted in left direction.
    The first row is untouched , the second by one
    shift, third by two and fourth by 3.
    Analysis of Steps
    Shift Rows

    Resulting matrix after shift operation


    Analysis of Steps
    Mix columns
    This is the most important part of the algorithm
    It causes the flip of bits to spread all over the block
    In this step the block is multiplied with a fixed matrix.
    The multiplication is field multiplication in galois field.
    For each row there are 16 multiplication, 12 XORs
    and a 4 byte output.
    Analysis of Steps
    Mix Columns
    Analysis of Steps
    Add round key
    Analysis of Steps
    Add round key
    In this step each byte is XOR-ed with
    corresponding element of key's matrix.
    Once this step is done the keys are no longer
    available for this step. Using the same key will
    weaken the algorithm.
    To overcome this problem keys are expanded.
    Analysis of Steps
    In the last round the mix column step is
    skipped.
    It is not documented anywhere why this is done
    but recently a paper was published against this
    method highlighting the weakening of cipher
    text.
    Attacks
    It is similar to the exhaustive key search attack(brute force attack -
    trying all the possible set of keys) but it is adaptive. It is 4 times better
    than the exhaustive key search. But it is infeasible using current
    technology on block cipher having a keyspace of 128 bits and above.

    There are more advanced attack on AES-256 bits like the Related Key
    Attack, which involves several distinct keys linked together by a
    common relation which reduces the keyspace to 99.5 bits which is
    also infeasible.

    You might also like