Optimization of Elliptic Curve Operations for ECM using Double & Add Algorithm
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
Optimization of Elliptic Curve Operations for ECM using Double & Add Algorithm
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
N - Vyzkumna aktivita podporovana z neverejnych zdroju
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
The Fourth International Conference on e-Technologies and Networks for Development (ICeND2015)
ISBN
978-1-4799-8450-3
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
34-37
Publisher name
Lodz University of Technology
Place of publication
Lodz
Event location
Lodz
Event date
Sep 21, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—