• DocumentCode
    2867136
  • Title

    Efficient SIMD Arithmetic Modulo a Mersenne Number

  • Author

    Bos, Joppe W. ; Kleinjung, Thorsten ; Lenstra, Arjen K. ; Montgomery, Peter L.

  • Author_Institution
    EPFL IC LACAL, Lausanne, Switzerland
  • fYear
    2011
  • fDate
    25-27 July 2011
  • Firstpage
    213
  • Lastpage
    221
  • Abstract
    This paper describes carry-less arithmetic operations modulo an integer 2^M-1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implementation on a cluster of PlayStation 3 game consoles a new record was set for the elliptic curve method for integer factorization.
  • Keywords
    parallel processing; public key cryptography; residue number systems; singular value decomposition; Mersenne number; PlayStation 3 game consoles; SIMD; carryless arithmetic operations modulo; elliptic curve method; integer factorization; single instruction multiple data; Computer architecture; Electronic countermeasures; Elliptic curves; Microprocessors; Pipelines; Polynomials; Registers; Cell processor; Elliptic curve method; Integer factorization; Mersenne number; Single Instruction Multiple Data;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic (ARITH), 2011 20th IEEE Symposium on
  • Conference_Location
    Tubingen
  • ISSN
    1063-6889
  • Print_ISBN
    978-1-4244-9457-6
  • Type

    conf

  • DOI
    10.1109/ARITH.2011.37
  • Filename
    5992129
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2867136