Performance analysis of parallel modular multiplication algorithms for ECC in mobile devices
Modular multiplication is the main operation in Elliptic Curve Cryptography (ECC) on prime finite fields. It is executed most of the time and is costly because it requires a modular reduction and a multi-precision method. Therefore, its cost increases in proportion to the ECC's key size. It cou...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculdade Salesiana Maria Auxiliadora
2014-06-01
|
Series: | Sistemas de Informação |
Subjects: | |
Online Access: | http://www.fsma.edu.br/si/edicao13/FSMA_SI_2014_1_Estudantil_4_en.html |