Ignore:
Timestamp:
Dec 4, 2008, 6:40:00 PM (13 years ago)
Author:
Sören Rinne
Message:
  • corrected some typos
File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/CrypPlugins/HIGHT/DetailedDescription/Description.xaml

    r116 r117  
    1111  </Paragraph>
    1212  <Paragraph>
    13       <Run FontSize="14.6666666666667" xml:lang="de-de">HIGHT is a block cipher proposed by Deukjo Hong et al. which is working on a 64-bit block length and a 128-bit key length. It was proposed to be used at ubiquitous computing devices such as a sensor in USN or a RFID tag at CHES ’06. It is predestinated for its application area due to its low-resource hardware implementation. The specialty of HIGHT is its use of simple operations such as exclusive-or, addition mod 28, and bitwise rotation. HIGHT is designed for being implemented in hardware to have a low cost of gates.</Run>
     13      <Run FontSize="14.6666666666667" xml:lang="de-de">HIGHT is a block cipher proposed by Deukjo Hong et al. which is working on a 64-bit block length and a 128-bit key length. It was proposed to be used at ubiquitous computing devices such as a sensor in ubiquitous sensor networks (USN) or a RFID tag at CHES ’06. The specialty of HIGHT is its use of simple operations such as exclusive-or, addition mod 2^8, and bitwise rotation. HIGHT is designed for being implemented in hardware to have a low cost of gates.</Run>
    1414  </Paragraph>
    1515  <Paragraph>
    16       <Run FontSize="14.6666666666667" xml:lang="de-de">The cipher is a variant of generalized Feistel network. It consists of an initial transformation, 32 rounds using 4 subkeys at a time, a final transformation and a key schedule producing 128 subkeys. HIGHTs key schedule algorithm is designed to keep the original value of the master key after generating all whitening keys and all subkeys. Therefore the subkeys are generated on the fly in encryption and decryption.</Run>
     16      <Run FontSize="14.6666666666667" xml:lang="de-de">The cipher is a variant of a generalized Feistel network. It consists of an initial transformation, 32 rounds using 4 subkeys at a time, a final transformation and a key schedule producing 128 subkeys. HIGHT's key schedule algorithm is designed to keep the original value of the master key after generating all whitening keys and all subkeys. Therefore the subkeys are generated on the fly for encryption and decryption.</Run>
    1717  </Paragraph>
    1818</FlowDocument>
Note: See TracChangeset for help on using the changeset viewer.