An Evaluation of the Sieving Device YASD for 1024-Bit Integers

Geiselmann and Steinwandt proposed an ASIC based hardware design “YASD” for the sieving step in the number field sieve (NFS) method of integer factorization in 2004. The design is attractive since its regular structure seems suitable for implementation, however, performance valuation for 1024-bit integers has not been provided. This paper firstly evaluates the performance of YASD for 1024-bit integers by a simple extrapolation under the same assumptions of the original YASD. In our estimation, optimized YASD for 1024-bit integers requires 42200 mm2 and about 10600 years for the sieving. Since we did not consider the wiring problem and the mini-factoring problem, even if YASD for 1024-bit integers are manufactured, further circuit area and time will be required.