Montgomery Modular Multiplication on ARM-NEON Revisited

DOI10.1007/978-3-319-15943-0_20zbMath1344.94073OpenAlexW304787937MaRDI QIDQ2942845

Johann Großschädl, Jongseok Choi, Hwajeong Seo, Zhe Liu, Howon Kim

Publication date: 11 September 2015

Published in: Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15943-0_20

zbMATH Keywords

public-key cryptographymodular arithmeticARM NEONSIMD-level parallelismvector instructions

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Montgomery Multiplication Using Vector Instructions
• Software Implementation of Modular Exponentiation, Using Advanced Vector Instructions Architectures
• Modular Multiplication Without Trial Division
• Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves

This page was built for publication: Montgomery Modular Multiplication on ARM-NEON Revisited