| EN, publication_article_article_name |
The Construction of ElGamal over Koblitz Curve |
| EN, publication_article_accepted_date |
20 February 2014 |
| EN, publication_article_journal |
| EN, publication_article_journal_name |
Advanced Materials Research |
| EN, publication_article_journal_standard |
SCOPUS |
| EN, publication_article_institute |
Advanced Materials Research |
| EN, publication_article_isbn |
ISBN-13: 978-3-03835-090-3 |
| EN, publication_article_year |
2014 |
| EN, publication_article_issue |
931-932 |
| EN, publication_article_month |
พฤษภาคม |
| EN, publication_article_print_year |
2014 |
| EN, publication_article_page |
1441-1446 |
| EN, publication_article_abstract |
Recently elliptic curve cryptosystems are widely accepted for security applications key generation, signature and verification. Cryptographic mechanisms based on elliptic curves depend on arithmetic involving the points of the curve. It is possible to use smaller primes, or smaller finite fields, with elliptic curves and achieve a level of security comparable to that for much larger integers. Koblitz curves, also known as anomalous binary curves, are elliptic curves defined over F2. The primary advantage of these curves is that point multiplication algorithms can be devised such that they do not use any point doublings. The ElGamal cryptosystem, which is based on the Discrete Logarithm problem can be implemented in any group. In this paper, we propose the ElGamal over Koblitz Curve Scheme by applying the arithmetic on Koblitz curve to the ElGamal cryptosystem. The advantage of this scheme is that point multiplication algorithms can speed up the scalar multiplication in the affine coordinate of the curves using Frobenius map. This curve has characteristic two, therefore its arithmetic designed in any computer hardware. Moreover, its arithmetic has more efficient to employ the TNAF method for scalar multiplication on Koblitz curves to decrease the number of nonzero digits. Its security relies on the inability of a forger, who does not know a private key, to compute elliptic curve discrete logarithm. |
| EN, publication_article_keyword |
Elliptic Curve, ElGamal Cryptosystem, Koblitz Curve, Scalar Multiplication, Finite Field |
| EN, publication_article_writer |
|
| EN, publication_article_evaluation |
มีผู้ประเมินอิสระ |
| EN, publication_article_status |
ตีพิมพ์แล้ว |
| EN, publication_article_level |
นานาชาติ |
| EN, publication_article_citation |
EN, publication_article_citation_false |
| EN, publication_article_part_of_thesis |
EN, publication_article_part_of_thesis_true |
| EN, publication_article_part_of_graduate |
EN, publication_article_part_of_graduate_false |
| EN, publication_attachment_file |
|
| Citation |
0
|
|
|
EN, publication_detail
EN, publication_article
ไทย