Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- Fast Modular ArithmeticImprovements of Montgomery ReductionGraphics Processing UnitFactoring using Elliptic Curves
- Contact author(s)
- wilke trei @ uni-oldenburg de
- History
- 2013-10-15: received
- Short URL
- https://ia.cr/2013/652
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/652,
author = {Wilke Trei},
title = {Efficient Modular Arithmetic for SIMD Devices},
howpublished = {Cryptology ePrint Archive, Paper 2013/652},
year = {2013},
note = {\url{https://eprint.iacr.org/2013/652}},
url = {https://eprint.iacr.org/2013/652}
}
