Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA

DOI10.1007/978-3-319-69453-5_26zbMath1418.94065OpenAlexW2766662633MaRDI QIDQ1698668

Cong Xue, Peng Liu, Wuqiong Pan, Jingqiang Lin, Yuan Zhao, Fangyu Zheng

Publication date: 16 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-69453-5_26

zbMATH Keywords

performanceRSAvectorizationMontgomery multiplicationIntel Xeon Phi

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Montgomery Modular Multiplication on ARM-NEON Revisited
• Fast Implementation of Curve25519 Using AVX2
• Montgomery Multiplication Using Vector Instructions
• Software Implementation of Modular Exponentiation, Using Advanced Vector Instructions Architectures
• Modular Multiplication Without Trial Division
• High-Performance Modular Multiplication on the Cell Processor
• ECM on Graphics Cards
• On Software Parallel Implementation of Cryptographic Pairings
• Curve41417: Karatsuba Revisited

This page was built for publication: Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA