Cryptology ePrint Archive: Report 2013/652

Efficient Modular Arithmetic for SIMD Devices

Wilke Trei

Abstract: This paper describes several new improvements of modular arithmetic and how to exploit them in order to gain more efficient implementations of commonly used algorithms, especially in cryptographic applications. We further present a new record for modular multiplications per second on a single desktop computer as well as a new record for the ECM factoring algorithm. This new results allow building personal computers which can handle more than 3 billion modular multiplications per second for a 192 bit module at moderate costs using modern graphic cards.

Category / Keywords: implementation / Fast Modular Arithmetic, Improvements of Montgomery Reduction, Graphics Processing Unit, Factoring using Elliptic Curves

Date: received 10 Oct 2013

Contact author: wilke trei at uni-oldenburg de

Available format(s): PDF | BibTeX Citation

Version: 20131015:065151 (All versions of this report)

Short URL: ia.cr/2013/652

Discussion forum: Show discussion | Start new discussion