On-the-Fly Multi-Base Recoding for ECC Scalar Multiplication without Pre-Computations

Thomas Chabrier 1 Arnaud Tisserand 1, *
* Corresponding author
1 CAIRN - Energy Efficient Computing ArchItectures with Embedded Reconfigurable Resources
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : Scalar recoding is popular to speed up ECC scalar multiplication: non-adjacent form, double-base number system, multi-base number system. But fast recoding methods require pre-computations: multiples of base point or off-line conversion. In this paper, we present a multi-base recoding method for ECC scalar multiplication based on i) a greedy algorithm starting least significant terms first, ii) cheap divisibility tests by multi-base elements and iii) fast exact divisions by multibase elements. Multi-base terms are obtained on-the-fly using a special recoding unit which operates in parallel to curve-level operations and at very high speed. This ensures that all recoding steps are performed fast enough to schedule the next curve-level operations without interruptions. The proposed method can be fully implemented in hardware without pre-computations. We report FPGA implementation details and very good performances compared to state-of-art results.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00772613
Contributor : Arnaud Tisserand <>
Submitted on : Thursday, January 10, 2013 - 6:22:40 PM
Last modification on : Wednesday, December 18, 2019 - 5:32:32 PM
Long-term archiving on: Thursday, April 11, 2013 - 4:08:52 AM

File

PID2635353.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Thomas Chabrier, Arnaud Tisserand. On-the-Fly Multi-Base Recoding for ECC Scalar Multiplication without Pre-Computations. ARITH - 21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.219-228, ⟨10.1109/ARITH.2013.17⟩. ⟨hal-00772613⟩

Share

Metrics

Record views

631

Files downloads

605