{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:00:29Z","timestamp":1725483629936},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1109\/synasc.2007.21","type":"proceedings-article","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T15:29:47Z","timestamp":1201620587000},"page":"59-65","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Multiple Polynomial Quadratic Sieve on Multi-Core Architectures"],"prefix":"10.1109","author":[{"given":"Georgiana","family":"Macariu","sequence":"first","affiliation":[]},{"given":"Dana","family":"Petcu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Symbolic computation and parallel software","year":"1991","author":"wang","key":"ref31"},{"key":"ref30","first-page":"51","article-title":"Finite field arithmetic using the connection machine","author":"sibert","year":"1990","journal-title":"Procs 2nd Workshop CA&Parallelism"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55826-9"},{"year":"0","key":"ref11"},{"journal-title":"The GNU Multiple Precision Arithmetic Library Manual Edition 4 2 2","year":"2006","key":"ref12"},{"journal-title":"On using an hybrid MPI-Thread programming for the implementation of a parallel sparse direct solver on a network of SMP nodes","year":"2005","author":"h\u00e8non","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013184"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61697-7_15"},{"key":"ref16","article-title":"Parallel algorithms for practical multiprecision arithmetic using the Karatsuba method","author":"jebelean","year":"2000","journal-title":"Tehnical Report 00-42"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0216002"},{"key":"ref18","article-title":"Parsac-2: parallel computer algebra","author":"k\u00fcchlin","year":"1995","journal-title":"Computer Algebra in Science and Engineering"},{"journal-title":"The Quadratic Sieve Factoring Algoriilim","year":"0","author":"landquist","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0208"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16776-5_738"},{"key":"ref27","first-page":"51","article-title":"Evaluation of performance enhancements in algebraic manipulation systems","author":"ponder","year":"1989","journal-title":"Computer Algebra and Parallelism Computational Mathematics and Applications"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48311-X_1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2007.29"},{"key":"ref29","first-page":"33","article-title":"PAC: Towards a parallel computer algebra coprocessor","author":"roch","year":"1989","journal-title":"Computer Algebra and Parallelism"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/155332.155350"},{"journal-title":"Modern Computer Algebra","year":"2003","author":"von zur gathen","key":"ref8"},{"key":"ref7","first-page":"329","article-title":"Systolic architectures for multiplication over finite fields GF2m","author":"diab","year":"1990","journal-title":"International Conference on Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"journal-title":"Factoring large integers using parallel Quadratic Sieve","year":"0","author":"asbrink","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/800068.802152"},{"key":"ref1","article-title":"A case study of multithreaded Gröbner basis completion","author":"amrhein","year":"1996","journal-title":"Procs ISSAC96"},{"key":"ref20","first-page":"355","article-title":"Factoring by electronic mail","author":"lenstra","year":"1989","journal-title":"Advances in Cryptology-EUROCRYPT 89"},{"article-title":"Parallel systems in symbolic and algebraic computation","year":"2001","author":"matooane","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-12868-9_93"},{"key":"ref24","first-page":"354","article-title":"Exponentiation in finite fields using dual basis multiplier","author":"morii","year":"1990","journal-title":"International Conference on Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"article-title":"An FFT extension of the elliptic curve method of factorization","year":"1992","author":"montgomery","key":"ref23"},{"key":"ref26","first-page":"27","article-title":"Cryptology and Computational Number Theory","author":"pomerance","year":"1990","journal-title":"vol 42 of Proceedings of Symposia in applied Mathematics"},{"key":"ref25","article-title":"Symbolic Computations on Grids","author":"petcu","year":"2006","journal-title":"Engineering the Grid Status and Perspective"}],"event":{"name":"2007 Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","start":{"date-parts":[[2007,9,26]]},"location":"Timisoara, Romania","end":{"date-parts":[[2007,9,29]]}},"container-title":["Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4438060\/4438061\/04438080.pdf?arnumber=4438080","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T18:39:13Z","timestamp":1489689553000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4438080\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/synasc.2007.21","relation":{},"subject":[],"published":{"date-parts":[[2007,9]]}}}