Montgomery multiplication using vector instructions

DOI10.1007/978-3-662-43414-7_24zbMATH Open1362.94022OpenAlexW2203293987MaRDI QIDQ2949546FDOQ2949546

Authors: Joppe W. Bos, Daniel Shumow, Gregory M. Zaverucha, Peter L. Montgomery 

Publication date: 1 October 2015

Published in: Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43414-7_24

Recommendations

• Montgomery modular multiplication on ARM-NEON revisited
• Software implementation of modular exponentiation, using advanced vector instructions architectures
• Applied Cryptography and Network Security
• Parallel modular multiplication with table look-up
• High-Performance Modular Multiplication on the Cell Processor

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Cited In (5)

• High-throughput elliptic curve cryptography using AVX2 vector instructions
• Software implementation of modular exponentiation, using advanced vector instructions architectures
• Implementing Montgomery multiplication to speed-up the computation of modular exponentiation of multi-bit numbers
• Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA
• Montgomery modular multiplication on ARM-NEON revisited

Uses Software

• gmp
• eBACS
• OpenSSL

This page was built for publication: Montgomery multiplication using vector instructions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949546)