Binary-Ternary Plus-Minus Modular Inversion in RNS

Karim Bigou 1 Arnaud Tisserand 1
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
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 % speed-up for a maximal area overhead about 4 % on Virtex 5 FPGAs.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01314268
Contributor : Arnaud Tisserand <>
Submitted on : Wednesday, May 11, 2016 - 9:53:19 AM
Last modification on : Thursday, October 10, 2019 - 10:49:15 AM
Long-term archiving on: Wednesday, November 16, 2016 - 12:35:09 AM

File

article_tc.pdf
Files produced by the author(s)

Identifiers

Citation

Karim Bigou, Arnaud Tisserand. Binary-Ternary Plus-Minus Modular Inversion in RNS. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2016, 65 (11), pp.3495-3501. ⟨10.1109/TC.2016.2529625⟩. ⟨hal-01314268⟩

Share

Metrics

Record views

574

Files downloads

332