View Document Preview and Link Document Date: 2015-01-20 08:14:47 Open Document File Size: 218,75 KB Share Result on Facebook
Company Intel / / / Event Product Release / / Facility Engineering Indian Institute of Technology Kharagpur / Intel’s Sandy Bridge / / IndustryTerm dot product / linear-algebra tools / subexponential algorithm / smallest solution / least possible solution / cryptographic protocols / exponential-time algorithms / integer-factoring algorithms / subexponential algorithms / lattice-basis reduction algorithm / earlier algorithms / root-finding algorithm / reduced using Lagrange’s lattice-basis reduction algorithm / / Organization Computer Science and Engineering Indian Institute of Technology Kharagpur / Binanda Sengupta and Abhijit Das Department of Computer Science / US Federal Reserve / / Person Abhijit Das / / Position vp / factorization vp vp vp / / Product Sandy Bridge processor / SSE2 / Sandy Bridge / / Technology exponential-time algorithms / Integer-Factoring Algorithms / rank-2 lattice-basis reduction algorithm / earlier algorithms / Sandy Bridge processor / subexponential algorithm / lattice-basis reduction algorithm / factoring algorithms / subexponential algorithms / Lq using Algorithm / root-finding algorithm / / SocialTag 
Use of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring Algorithms ? Binanda Sengupta and Abhijit Das Department of Computer Science and Engineering Indian Institute of Technology Kharagpur, West Beng