Montgomery modular multiplication on ARM-NEON revisited

DOI10.1007/978-3-319-15943-0_20zbMATH Open1344.94073OpenAlexW304787937MaRDI QIDQ2942845FDOQ2942845

Authors: Hwajeong Seo, Zhe Liu, Johann Großschädl, Jongseok Choi, 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

Recommendations

• Montgomery multiplication using vector instructions
• New speed records for Montgomery modular multiplication on 8-bit AVR microcontrollers
• Compact implementation of modular multiplication for special modulus on MSP430X
• A scalable and systolic architectures of Montgomery modular multiplication for public key cryptosystems based on DSPS
• High-Performance Modular Multiplication on the Cell Processor

zbMATH Keywords

public-key cryptographymodular arithmeticARM NEONSIMD-level parallelismvector instructions

Mathematics Subject Classification ID

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

Cites Work

• Modular Multiplication Without Trial Division
• Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
• Montgomery multiplication using vector instructions
• Software implementation of modular exponentiation, using advanced vector instructions architectures

Cited In (2)

• Montgomery multiplication using vector instructions
• Phirsa: exploiting the computing power of vector instructions on Intel Xeon Phi for RSA

This page was built for publication: Montgomery modular multiplication on ARM-NEON revisited

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