• DocumentCode
    926273
  • Title

    Algorithm for unified modular division in GF(p) and GF(2n) suitable for cryptographic hardware

  • Author

    Tenca, A.F. ; Tawalbeh, L.A.

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Oregon State Univ., Corvallis, OR, USA
  • Volume
    40
  • Issue
    5
  • fYear
    2004
  • fDate
    3/4/2004 12:00:00 AM
  • Firstpage
    304
  • Lastpage
    306
  • Abstract
    A unified algorithm to compute modular division in both GF(p) and GF(2n) fields is presented. It uses a counter variable to keep track of the difference between two field elements, and in this way eliminates the need for comparisons which are usually expensive and time-consuming. The computations in both fields are performed using additions/subtractions and bit shifts, besides using a simple control flow, which makes it suitable for hardware implementation.
  • Keywords
    computational complexity; cryptography; GF(2") field; GF(p) field; additions/subtraction computation; bit shift computation; cryptographic hardware; hardware implementation; unified modular division algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20040233
  • Filename
    1273943
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=926273