Abstract
In this paper, we present the Arbitrary Precision Arithmetic Library - ArPALib, suitable for algorithms that require integer data representation with an arbitrary bit-width (up to 4096-bit in this study). The unique feature of the library is suitability to be synthesized by HLS (High Level Synthesis) tools, while maintaining full compatibility with C99 standard. To validate the applicability of ArPALib for the FPGAenhanced SoCs, the Miller-Rabin primality test algorithm is considered as a case study. Also, we provide the performance analysis of our library in the software and hardware applications. The presented results show the speedup of 1.5 of the hardware co-processor over its software counterpart when ApPALib is used.
Author supplied keywords
Cite
CITATION STYLE
Macheta, J., Dabrowska-Boruch, A., Russek, P., & Wiatr, K. (2017). ArPALib: A big number arithmetic library for hardware and software implementations. A case study for the miller–rabin primality test. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10216 LNCS, pp. 323–330). Springer Verlag. https://doi.org/10.1007/978-3-319-56258-2_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
