Montgomery algorithm on elliptic curves over finite fields of character three
Application of Montgomery algorithm on elliptic curves defined over finite fields of character three was re-searched.Due to the structure of Montgomery algorithm,y-coordinate was ignored,a new formula to compute point ad-dition and point doubling was proposed to accelerate the scalar point multiplic...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2008-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74654028/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537578460774400 |
|---|---|
| author | WANG Hong1 LI Bao1 YU Wei2 |
| author_facet | WANG Hong1 LI Bao1 YU Wei2 |
| author_sort | WANG Hong1 |
| collection | DOAJ |
| description | Application of Montgomery algorithm on elliptic curves defined over finite fields of character three was re-searched.Due to the structure of Montgomery algorithm,y-coordinate was ignored,a new formula to compute point ad-dition and point doubling was proposed to accelerate the scalar point multiplication.According to theoretical analysis and experimental verification,new formula saves about 15 percent running time. |
| format | Article |
| id | doaj-art-e4e4d60a38ef488db8170cf7c265254f |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2008-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-e4e4d60a38ef488db8170cf7c265254f2025-01-14T08:32:10ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2008-01-01252974654028Montgomery algorithm on elliptic curves over finite fields of character threeWANG Hong1LI Bao1YU Wei2Application of Montgomery algorithm on elliptic curves defined over finite fields of character three was re-searched.Due to the structure of Montgomery algorithm,y-coordinate was ignored,a new formula to compute point ad-dition and point doubling was proposed to accelerate the scalar point multiplication.According to theoretical analysis and experimental verification,new formula saves about 15 percent running time.http://www.joconline.com.cn/zh/article/74654028/elliptic curveMontgomery algorithmGF（3m）scalar multiplication |
| spellingShingle | WANG Hong1 LI Bao1 YU Wei2 Montgomery algorithm on elliptic curves over finite fields of character three Tongxin xuebao elliptic curve Montgomery algorithm GF（3m） scalar multiplication |
| title | Montgomery algorithm on elliptic curves over finite fields of character three |
| title_full | Montgomery algorithm on elliptic curves over finite fields of character three |
| title_fullStr | Montgomery algorithm on elliptic curves over finite fields of character three |
| title_full_unstemmed | Montgomery algorithm on elliptic curves over finite fields of character three |
| title_short | Montgomery algorithm on elliptic curves over finite fields of character three |
| title_sort | montgomery algorithm on elliptic curves over finite fields of character three |
| topic | elliptic curve Montgomery algorithm GF（3m） scalar multiplication |
| url | http://www.joconline.com.cn/zh/article/74654028/ |
| work_keys_str_mv | AT wanghong1 montgomeryalgorithmonellipticcurvesoverfinitefieldsofcharacterthree AT libao1 montgomeryalgorithmonellipticcurvesoverfinitefieldsofcharacterthree AT yuwei2 montgomeryalgorithmonellipticcurvesoverfinitefieldsofcharacterthree |