Paper
12 April 2010 Nios II hardware acceleration of the epsilon quadratic sieve algorithm
Author Affiliations +
Abstract
The quadratic sieve (QS) algorithm is one of the most powerful algorithms to factor large composite primes used to break RSA cryptographic systems. The hardware structure of the QS algorithm seems to be a good fit for FPGA acceleration. Our new ε-QS algorithm further simplifies the hardware architecture making it an even better candidate for C2H acceleration. This paper shows our design results in FPGA resource and performance when implementing very long arithmetic on the Nios microprocessor platform with C2H acceleration for different libraries (GMP, LIP, FLINT, NRMP) and QS architecture choices for factoring 32-2048 bit RSA numbers.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Uwe Meyer-Bäse, Guillermo Botella, Encarnacion Castillo, and Antonio García "Nios II hardware acceleration of the epsilon quadratic sieve algorithm", Proc. SPIE 7703, Independent Component Analyses, Wavelets, Neural Networks, Biosystems, and Nanoengineering VIII, 77030M (12 April 2010); https://doi.org/10.1117/12.849883
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Field programmable gate arrays

Laser induced plasma spectroscopy

Bismuth

Evolutionary algorithms

Convolution

Algorithm development

Composites

RELATED CONTENT


Back to Top