Automatic Generation of Vectorized Montgomery Algorithm

09/04/2016
by   Lingchuan Meng, et al.
0

Modular arithmetic is widely used in crytography and symbolic computation. This paper presents a vectorized Montgomery algorithm for modular multiplication, the key to fast modular arithmetic, that fully utilizes the SIMD instructions. We further show how the vectorized algorithm can be automatically generated by the system, as part of the effort for automatic generation of a modular polynomial multiplication library.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/05/2016

Automatic Library Generation for Modular Polynomial Multiplication

Polynomial multiplication is a key algorithm underlying computer algebra...
research
01/15/2018

A Multi-layer Recursive Residue Number System

We present a method to increase the dynamical range of a Residue Number ...
research
04/24/2020

High performance SIMD modular arithmetic for polynomial evaluation

Two essential problems in Computer Algebra, namely polynomial factorizat...
research
01/06/2023

Grokking modular arithmetic

We present a simple neural network that can learn modular arithmetic tas...
research
08/05/2023

Understanding the RSA algorithm

With the emerging importance of cybersecurity, it will be beneficial for...
research
10/05/2019

Secure Montgomery Multiplication and Repeated Squares for Modular Exponentiation

The BMR16 circuit garbling scheme introduces gadgets that allow for ciph...
research
07/06/2017

pch2csd: an application for converting Nord Modular G2 patches into Csound code

The paper presents the pch2csd project, focused on converting patches of...

Please sign up or login with your details

Forgot password? Click here to reset