Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Speed Records for Multi-prime RSA Using AVX2 Architectures
verfasst von : Shay Gueron, Vlad Krasnov
Erschienen in: Information Technology: New Generations
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
RSA is a popular public key algorithm. Its private key operation is modular exponentiation with a composite 2k-bit modulus that is the product of two k-bit primes. Computing 2k-bit modular exponentiation can be sped up four fold with the Chinese Remainder Theorem (CRT), requiring two k-bit modular exponentiations (plus recombination). Multi-prime RSA is the generalization to the case where the modulus is a product of r ≥ 3 primes of (roughly) equal bit-length, 2k/r. Here, CRT trades 2k-bit modular exponentiation with r modular exponentiations, with 2k/r-bit moduli (plus recombination). This paper discusses multi-prime RSA with key lengths (=2k) of 2048/3072/4096 bits, and r = 3 or r = 4 primes. With these parameters, the security of multi-prime RSA is comparable to that of classical RSA. We show how to optimize multi-prime RSA on modern processors, by parallelizing r modular exponentiations and leveraging “vector” instructions, achieving performance gains of up to 5.07x.