Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor
Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GC...
Uloženo v:
| Vydáno v: | 2014 9th IEEE International Conference on Networking, Architecture, and Storage s. 113 - 117 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.08.2014
|
| Témata: | |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor. This algorithm is capable of computing GCDs efficiently on many pairs of big integers in parallel by utilizing all cores on a Xeon Phi coprocessor as well as taking advantage of all vector processing units of the coprocessor to speed up critical integer operations within the algorithm. Using 240 threads on a Xeon Phi coprocessor to carry out GCD calculations for a large amount of 2048-bit integers, the implementation achieves the speedup of 30 times over a sequential binary GCD algorithm implementation on a single CPU core, and it delivers twice amount of performance in comparison to the same sequential binary GCD implementation running on 240 threads of the Xeon Phi. |
|---|---|
| AbstractList | Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor. This algorithm is capable of computing GCDs efficiently on many pairs of big integers in parallel by utilizing all cores on a Xeon Phi coprocessor as well as taking advantage of all vector processing units of the coprocessor to speed up critical integer operations within the algorithm. Using 240 threads on a Xeon Phi coprocessor to carry out GCD calculations for a large amount of 2048-bit integers, the implementation achieves the speedup of 30 times over a sequential binary GCD algorithm implementation on a single CPU core, and it delivers twice amount of performance in comparison to the same sequential binary GCD implementation running on 240 threads of the Xeon Phi. |
| Author | Watson, William Chen, Mayee F. Jie Chen |
| Author_xml | – sequence: 1 surname: Jie Chen fullname: Jie Chen email: chen@jlab.org organization: Sci. Comput. Group, Jefferson Lab., Newport News, VA, USA – sequence: 2 givenname: William surname: Watson fullname: Watson, William email: watson@jlab.org organization: Sci. Comput. Group, Jefferson Lab., Newport News, VA, USA – sequence: 3 givenname: Mayee F. surname: Chen fullname: Chen, Mayee F. email: mayeefchen@gmail.com organization: Jamestown High Sch., Williamsburg, VA, USA |
| BookMark | eNotjEFLwzAYhiMo6OZOHr3kD7Qm6dcvyXGrcw6GCip4G2n7ZQZcM5J68N9b0Mv7wMPDO2PnQxyIsRspSimFvXtavpZKSChVfcZmErS1IIy2l2yRc2iFQo0AEq7Yau196AINI98097yJx9P36MYQB-5j4qtw4NthpAOlzCf3QdO8fIYpPKXYUc4xXbML774yLf45Z-8P67fmsdg9b7bNclcEqeuxcE7pHrVDaCViW2nj0AN6A9hbMmKyFrXqKuNsj6qSHZjWYAeyBupFXc3Z7d9vIKL9KYWjSz97tFOKpvoFZF9Hag |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/NAS.2014.25 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 1479940879 9781479940875 |
| EndPage | 117 |
| ExternalDocumentID | 6923168 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL ALMA_UNASSIGNED_HOLDINGS CBEJK RIB RIC RIE RIL |
| ID | FETCH-LOGICAL-i175t-aa27d67a64b166b378a6f46f846d9e80b169672c38a9d6231c48b86c4154ed053 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000363981700014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Dec 20 05:18:27 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i175t-aa27d67a64b166b378a6f46f846d9e80b169672c38a9d6231c48b86c4154ed053 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_6923168 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-Aug. |
| PublicationDateYYYYMMDD | 2014-08-01 |
| PublicationDate_xml | – month: 08 year: 2014 text: 2014-Aug. |
| PublicationDecade | 2010 |
| PublicationTitle | 2014 9th IEEE International Conference on Networking, Architecture, and Storage |
| PublicationTitleAbbrev | NAS |
| PublicationYear | 2014 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssib026764414 |
| Score | 1.5688598 |
| Snippet | Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 113 |
| SubjectTerms | Arrays Coprocessors GCD Graphics processing units Instruction sets OpenMP Parallel algorithms RSA Vectorization Vectors Xeon Phi |
| Title | Efficient GCD Computation for Big Integers on Xeon Phi Coprocessor |
| URI | https://ieeexplore.ieee.org/document/6923168 |
| WOSCitedRecordID | wos000363981700014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T0IxGG2AODipAeM7HRyt3D742o6CoBMhURM20tfFuwBB8Pfb9iI6uLg0zZfbNO1tc07a7_QgdOt4MNQXggTeE0TEHUQUNUBo6UCWtGeUtNlsQo7HajrVkwa622thQgg5-Szcp2q-y_dLt01HZV1IbARUEzWlhFqr9b12GMiE7GInwaOF7o4fXlLqlsg22L-sUzJyjI7-1-cx6vxI8PBkDy4nqBEWbdQf5gcfYgP8NHjEtSNDnlocuSfuV3OcTvjmkdLhGJuGWEzeq_jhqtYDLNcd9DYavg6eyc4EgVQR2TfEGCY9SAPCUgDLpTJQCigjb_A6qCJGNUjmuDLaRy5DnVBWgYvALIKPW-wUtRbLRThD2AjLfeGN1awQrsetBsaop4W33gTOzlE7jX-2qt-5mO2GfvF3-BIdptmtk-GuUGuz3oZrdOA-N9XH-ib_nC9GqpCc |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGP2CaKInNWD8bQ8eraxbabujoIgRFxIx4Ub6a7gLEAT_fttuogcvXprmy5qmXZv30n6vD-BaJ1YSE1FskzbF1O0gLIhkmOSa8Zy0peAqmE3wLBPjcTqswc1GC2OtDcln9tZXw12-meu1PyprMc9GmNiCbe-cVam1vldPzLjHdlqJ8EiUtrK7V5-8RYMR9i_zlIAdvf3_9XoAzR8RHhpu4OUQanbWgM5DePLBNUCP3XtUejKEyUWOfaJOMUX-jG_qSB1ysbF1xfC9cB8uSkXAfNmEt97DqNvHlQ0CLhy2r7CUMTeMS0YVYUwlXEiWU5Y75mBSKyIXTRmPdSJkahybIZoKJZh20EytcZvsCOqz-cweA5JUJSYyUqVxRHU7USmLY2JIZJSRNolPoOHHP1mUL11MqqGf_h2-gt3-6GUwGTxlz2ew52e6TI07h_pqubYXsKM_V8XH8jL8qC8CqpPl |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2014+9th+IEEE+International+Conference+on+Networking%2C+Architecture%2C+and+Storage&rft.atitle=Efficient+GCD+Computation+for+Big+Integers+on+Xeon+Phi+Coprocessor&rft.au=Jie+Chen&rft.au=Watson%2C+William&rft.au=Chen%2C+Mayee+F.&rft.date=2014-08-01&rft.pub=IEEE&rft.spage=113&rft.epage=117&rft_id=info:doi/10.1109%2FNAS.2014.25&rft.externalDocID=6923168 |