• DocumentCode
    1394522
  • Title

    Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t

  • Author

    Chiou, Che Wun ; Chuang, T.-P. ; Lin, Shih-Syun ; Lee, Chen-Yi ; Lin, Jim-Min ; Yeh, Y.-C.

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Chien Hsin Univ. of Sci. & Technol., Jhongli, Taiwan
  • Volume
    6
  • Issue
    4
  • fYear
    2012
  • Firstpage
    318
  • Lastpage
    323
  • Abstract
    Palindromic representation is generally used to reduce space and time complexities in Gaussian normal basis (GNB) multiplier with even type t. However, palindromic representation is inapplicable for a GNB multiplier with odd type t (t ≥ 2). This study therefore develops a palindromic-like representation for a GNB multiplier with odd type t. The proposed systolic GNB multiplier with odd type t reduces space and time complexities by as much as 50% compared with conventional GNB multiplier with odd type t without palindromic representation.
  • Keywords
    Gaussian processes; computational complexity; cryptography; Gaussian normal basis multiplier; palindromic representation; space complexity; time complexity;
  • fLanguage
    English
  • Journal_Title
    Information Security, IET
  • Publisher
    iet
  • ISSN
    1751-8709
  • Type

    jour

  • DOI
    10.1049/iet-ifs.2012.0200
  • Filename
    6404340
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1394522