Scribd Logo
Upload

Welcome to Scribd!

  • 78 views

    Introduction To Galois Field For AES

    Uploaded by

    Digital Restu Fadzil Hafizi
    This document provides an introduction to Galois fields and finite fields, which are important concepts in cryptography. It discusses the basics of groups, rings, and fields in algebra. Finite fields have a finite number of elements and operations that follow certain properties. Prime fields are based on prime numbers and modular arithmetic. Extension fields allow for larger finite fields through polynomial arithmetic over prime fields. AES uses a specific extension field GF(2^8) for its operations. The construction of the AES S-box involves finding inverses in this field through affine transformations.

    Copyright:

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

    Introduction To Galois Field For AES

    Uploaded by

    Digital Restu Fadzil Hafizi
    78 views23 pages
    This document provides an introduction to Galois fields and finite fields, which are important concepts in cryptography. It discusses the basics of groups, rings, and fields in algebra. Finite fields have a finite number of elements and operations that follow certain properties. Prime fields are based on prime numbers and modular arithmetic. Extension fields allow for larger finite fields through polynomial arithmetic over prime fields. AES uses a specific extension field GF(2^8) for its operations. The construction of the AES S-box involves finding inverses in this field through affine transformations.

    Original Title

    Introduction to Galois Field for AES

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an introduction to Galois fields and finite fields, which are important concepts in cryptography. It discusses the basics of groups, rings, and fields in algebra. Finite fields have a finite number of elements and operations that follow certain properties. Prime fields are based on prime numbers and modular arithmetic. Extension fields allow for larger finite fields through polynomial arithmetic over prime fields. AES uses a specific extension field GF(2^8) for its operations. The construction of the AES S-box involves finding inverses in this field through affine transformations.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    78 views23 pages

    Introduction To Galois Field For AES

    Uploaded by

    Digital Restu Fadzil Hafizi
    This document provides an introduction to Galois fields and finite fields, which are important concepts in cryptography. It discusses the basics of groups, rings, and fields in algebra. Finite fields have a finite number of elements and operations that follow certain properties. Prime fields are based on prime numbers and modular arithmetic. Extension fields allow for larger finite fields through polynomial arithmetic over prime fields. AES uses a specific extension field GF(2^8) for its operations. The construction of the AES S-box involves finding inverses in this field through affine transformations.

    Copyright:

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

    Introduction to Galois Field

    for AES
    Overview

    AES
    Finite Field Prime Field
    Overview

    Application Extension
    in AES Field
    AES Overview

      Plaintext,
    128 bit
    AES 128 bit
      Ciphertext,

    128/192/256 bit

      Key,
    AES Overview
    • Symmetric key
    • At least 10 rounds of encryption/decryption
    • Four layers operation
    • SubByte
    • ShiftRow
    • MixColumn
    • AddRoundKey
    • All internal operation of AES are based on finite field
    Introduction to Finite
    Field/Galois Field
    Some Algebraic Concept
    • Three basic algebraic concept
    • Group
    • Ring
    • Field

    Group,

    Ring,

    Field,
     
    Group,
    •A  group is a set of elements together with an operation which
    combines two elements of . A group has the following properties,

    1. The group operation is closed. For all it hold that


    2. The group operation is associative. That is , for all
    3. There is an identity element such that for all ,
    4. For each , there exist an inverse element such that
     Field ,
    •A  field is a set of elements with the following properties:

    1. All element of form an additive group with the group operation and identity .
    2. All element of except form a multiplicative group with the group operation
    and identity .
    3. When the two operation are mixed, the distributive law holds, i.e.
    , for all
    Finite Field in Cryptography
    • Cryptography always work with finite field.
    • Finite field is a field with finite elements.
    • Also called as Galois Field.
    • The size of field (the number of elements in such field) is called
    cardinality or order.
    Some example
    •1.  FF with 5 elements denoted as
    2. FF with 11 elements denoted as
    3. FF with 81 elements denoted as
    4. FF with 256 elements denoted as

     In general, finite field only exist with prime cardinality or prime power
    cardinality.

    Where is prime and


    Prime Field
    Prime Field
    •  Denoted as , where is prime.

    • Prime number of element, 2,3,5,7…


    • Arithmetic are done in modulo (modular arithmetic)
    Another example
    •Consider
      a finite field with 5 elements

    • It can form a group under addition


    • Also form a group under multiplication
    • Distributive law hold.
    Smallest Prime Field
    •  A very important prime field in symmetric cryptography is
    • Addition operation similar to XOR gate
    • Multiplication operation similar to AND gate.
    • Very important field in AES
    Extension Field
    𝒎
    𝑮𝑭(𝒑 )
     

       
    , ,

    Prime Field Extension Field

     
    In AES, we are interested with
    Extension Field Arithmetic
    •The
      arithmetic is still modular, however, the method of computing are
    very different.
    1. Element representation
    • Element in are represented as polynomial.

    where and
    2. Addition and Subtraction
    • Use regular polynomial addition/subtraction where the coefficient are
    computed in .
    Extension Field Arithmetic
    •3.  Multiplication in
    • Regular polynomial multiplication
    • Coefficient in
    • Reduction using long division
    4. Inversion in
    • The inverse must fulfilled
    Application in AES
    Construction of S-Box
    Process of construction

     
    Affine
    inversion
    transformation
    Process of Construction
    •  Find the inverse

    for all 256 elements in using the arithmetic introduce in finite


    field extension with respect to the following irreducible polynomial

    You might also like