Binary-Ternary Plus-Minus Modular Inversion in RNS

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 inversio...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník 65; číslo 11; s. 3495 - 3501
Hlavní autoři:	Bigou, Karim, Tisserand, Arnaud
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.11.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Témata:	Approximation algorithms Computer Arithmetic Computer Science Cryptography and Security ECC Elliptic curve cryptography Engineering Sciences Euclidean algorithms extended Euclidean algorithm Field programmable gate arrays FPGA Micro and nanotechnologies Microelectronics modular arithmetic Residue number system Signal processing algorithms Modular Arithmetic ECC Extended Euclidean Algorithm FPGA Residue Number System
ISSN:	0018-9340, 1557-9956
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
Bibliografie:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	0018-9340 1557-9956
DOI:	10.1109/TC.2016.2529625