ACAC Seminar Abstract

ACAC Seminar Abstract

ACAC Seminars

ACAC Seminar Abstract

Factoring in Hardware

Speaker: Kris Gaj
Date, Time: Fri, 31 Aug 2007 14:00

Difficulty of factoring large integers is at the core of the security of RSA, one of the most commonly used cryptographic algorithms protecting majority of the today's on-line financial transactions. Most recently, an effort has started in the open cryptographic community to estimate the difficulty and cost of factoring RSA keys using hardware based on Field Programmable Gate Arrays (FPGAs) and/or Application Specific Integrated Circuits (ASICs). In this talk, we will summarize the progress in this area, and then describe a research project conducted at George Mason University aimed at optimizing and implementing four special purpose factoring methods, trial division, rho, p-1, and ECM (Elliptic Curve Method). These methods can be applied in series to the outputs of the sieving phase of the Number Field Sieve, the best currently known general-purpose method of factoring large integers. A timing comparison to optimized software implementations will be presented, as well as a comparison in terms of the performance to cost ratio among the FPGA, ASIC, and microprocessor technologies.

Back to the top of this page