• DocumentCode
    3244681
  • Title

    On a parallel extended Euclidean algorithm

  • Author

    Sedjelmaci, Sidi Mohammed

  • Author_Institution
    Inst. Galilee, Univ. de Paris-Nord, Villetaneuse, France
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    235
  • Lastpage
    241
  • Abstract
    A new parallelization of the extended Euclidean GCD algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel Oeps(n/log n) using only n1+eps processors on a Priority CRCW PRAM, for any constant eps>0
  • Keywords
    computational complexity; mathematics computing; parallel algorithms; Priority CRCW PRAM; extended Euclidean GCD algorithm; greatest common divisor; parallel extended Euclidean algorithm; parallelization; Algorithm design and analysis; Arithmetic; Computational efficiency; Cryptography; Packaging; Phase change random access memory; Sections; Systolic arrays;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Systems and Applications, ACS/IEEE International Conference on. 2001
  • Conference_Location
    Beirut
  • Print_ISBN
    0-7695-1165-1
  • Type

    conf

  • DOI
    10.1109/AICCSA.2001.933982
  • Filename
    933982
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3244681