Optimization of Elliptic Curve Operations for ECM using Double & Add Algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F15%3A00232762" target="_blank" >RIV/68407700:21240/15:00232762 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/ICeND.2015.7328534" target="_blank" >http://dx.doi.org/10.1109/ICeND.2015.7328534</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ICeND.2015.7328534" target="_blank" >10.1109/ICeND.2015.7328534</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization of Elliptic Curve Operations for ECM using Double & Add Algorithm

Popis výsledku v původním jazyce

Nowadays the security becomes more and more important and as a need for secure data encryption grows, we have to be sure that the algorithms we are using are safe. But it is not always just about algorithm itself as about settings, for example key length. RSA, the most popular asymmetric cipher is a perfect example, because it fully depends on hardness of large numbers factorization. In this paper, we propose a novel approach for Elliptic Curve Method (ECM) which speeds-up the factorization time in affine coordinates, thanks to optimizing the calculation steps for need of a Double & Add algorithm. However, proposed equations could be used also in general Elliptic Curve Cryptography (ECC) or Elliptic Curve Digital Signature Algorithm (ECDSA), where thesame principle is used and thus can make the operations faster.

Název v anglickém jazyce

Optimization of Elliptic Curve Operations for ECM using Double & Add Algorithm

Popis výsledku anglicky

Nowadays the security becomes more and more important and as a need for secure data encryption grows, we have to be sure that the algorithms we are using are safe. But it is not always just about algorithm itself as about settings, for example key length. RSA, the most popular asymmetric cipher is a perfect example, because it fully depends on hardness of large numbers factorization. In this paper, we propose a novel approach for Elliptic Curve Method (ECM) which speeds-up the factorization time in affine coordinates, thanks to optimizing the calculation steps for need of a Double & Add algorithm. However, proposed equations could be used also in general Elliptic Curve Cryptography (ECC) or Elliptic Curve Digital Signature Algorithm (ECDSA), where thesame principle is used and thus can make the operations faster.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

N - Vyzkumna aktivita podporovana z neverejnych zdroju

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

The Fourth International Conference on e-Technologies and Networks for Development (ICeND2015)

ISBN

978-1-4799-8450-3

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

34-37

Název nakladatele

Lodz University of Technology

Místo vydání

Lodz

Místo konání akce

Lodz

Datum konání akce

21. 9. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—