{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:19:43Z","timestamp":1730222383266,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/fpt.2004.1393277","type":"proceedings-article","created":{"date-parts":[[2005,3,21]],"date-time":"2005-03-21T20:07:39Z","timestamp":1111435659000},"page":"263-270","source":"Crossref","is-referenced-by-count":2,"title":["Reconfigurable hardware implementation of mesh routing in number field sieve factorization"],"prefix":"10.1109","author":[{"given":"S.","family":"Bajracharya","sequence":"first","affiliation":[]},{"given":"D.","family":"Misra","sequence":"additional","affiliation":[]},{"given":"K.","family":"Gaj","sequence":"additional","affiliation":[]},{"given":"T.","family":"El-Ghazawi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"55","article-title":"Factoring estimates for a 1024-bit RSA modulus","volume":"2894","author":"lenstra","year":"2003","journal-title":"LNCS"},{"key":"2","first-page":"1","article-title":"Analysis of Bernstein's factorization circuit","volume":"2501","author":"lenstra","year":"2002","journal-title":"LNCS"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258742"},{"key":"1","first-page":"1","article-title":"Factorization of a 512-bit RSA modulus","volume":"1807","author":"lenstra","year":"2000","journal-title":"LNCS"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.2307\/2153413"},{"key":"6","first-page":"10","article-title":"On the cost of factoring RSA-1024","volume":"6","author":"shamir","year":"2003","journal-title":"RSA CryptoBytes"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1992-00284-7"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057137"},{"journal-title":"Circuits for Integer Factorization A Proposal","year":"0","author":"bernstein","key":"8"},{"journal-title":"Factoring Large Numbers with Programmable Hardware","year":"0","author":"kim","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45238-6_5"}],"event":{"name":"2004 IEEE International Conference on Field- Programmable Technology","acronym":"FPT-04","location":"Brisbane, NSW, Australia"},"container-title":["Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9585\/30303\/01393277.pdf?arnumber=1393277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T04:30:22Z","timestamp":1489552222000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1393277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/fpt.2004.1393277","relation":{},"subject":[]}}