Binary-Ternary Plus-Minus Modular Inversion in RNS
- 25 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 65 (11), 3495-3501
- https://doi.org/10.1109/tc.2016.2529625
Abstract
A fast RNS modular inversion for finite fields arithmetic has been published at CHES 2013 conference. It is based on the binary version of the plus-minus Euclidean algorithm. In the context of elliptic curve cryptography (i.e., 160-550 bits finite fields), it significantly speeds-up modular inversions. In this paper, we propose an improved version based on both radix 2 and radix 3. This new algorithm leads to 30 percent speed-up for a maximal area overhead about 4 percent on Virtex 5 FPGAs.Funding Information
- DGA-INRIA
- PAVOIS project (ANR 12 BS02 002 01)
This publication has 24 references indexed in Scilit:
- Single Base Modular Multiplication for Efficient Hardware RNS Implementations of ECCPublished by Springer Science and Business Media LLC ,2015
- Multifunction Residue Architectures for CryptographyIEEE Transactions on Circuits and Systems I: Regular Papers, 2014
- On-the-Fly Multi-base Recoding for ECC Scalar Multiplication without Pre-computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Improving Modular Inversion in RNS Using the Plus-Minus MethodLecture Notes in Computer Science, 2013
- An Algorithmic and Architectural Study on Montgomery Exponentiation in RNSIEEE Transactions on Computers, 2012
- FPGA Implementation of Pairings Using Residue Number System and Lazy ReductionLecture Notes in Computer Science, 2011
- RNS arithmetic in 𝔽 pk and application to fast pairing computationJournal of Mathematical Cryptology, 2011
- An RNS Implementation of an $F_{p}$ Elliptic Curve Point MultiplierIEEE Transactions on Circuits and Systems I: Regular Papers, 2008
- Parallel FPGA Implementation of RSA with Residue Number Systems—Can side-channel threats be avoided?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Systolic VLSI Arrays for Polynomial GCD ComputationIEEE Transactions on Computers, 1984