Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)
Elliptic Curve Cryptography (ECC) is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks. One of the most time consuming processes in ECC algorithm for encryption/decryption is the scalar multiplication, i. e. , KP, where P is the text...
Gespeichert in:
| Veröffentlicht in: | International journal of computer applications 2012-01, Vol.49 (7), p.46-50 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 50 |
|---|---|
| container_issue | 7 |
| container_start_page | 46 |
| container_title | International journal of computer applications |
| container_volume | 49 |
| creator | N, Shylashree Venkata Narayana Reddy, D. Sridhar, V. |
| description | Elliptic Curve Cryptography (ECC) is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks. One of the most time consuming processes in ECC algorithm for encryption/decryption is the scalar multiplication, i. e. , KP, where P is the text which is on the elliptic curve. This paper examines that computation can be speeded up by using Ancient Indian Vedic Mathematics. Coding is done using Verilog-HDL and downloaded on target device as Virtex 5. Our proposed work is six times faster than the previous work when applied in point doubling using Spartan3 as target device. |
| doi_str_mv | 10.5120/7643-0730 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671469732</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2839086121</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1700-a245c70049e1c550a2d4c6ebf31e167888426958cb51c72fc67f2d2f2b9725b53</originalsourceid><addsrcrecordid>eNpdkTtrwzAUhU1poSHN0H8g6JIMbvWwLHsMIUkDCR36WI0sS4mCbLmSHcjcP16ZZCi9yz1wPw73cKLoEcFnijB8YWlCYsgIvIlGMGc0zrKM3f7R99HE-yMMQ3Kc5sko-lkqpYWWTQc2dWtkHRTvtG2AVeBdcMMd2PWm063R4nJQ1oGlMbrttACL3p0kWLhz29m94-3hDHqvmz2YN1fXptK8AV-yCvSOdwdZBxvhgT1JB9araTt7iO4UN15Ornscfa6WH4vXePu23izm21ggBmHMcUJFEEkukaAUclwlIpWlIkiilIV8SchEM1FSJBhWImUKV1jhMmeYlpSMo-nFt3X2u5e-K2rthTSGN9L2vggmKElzRnBAn_6hR9u7JnxXIEwYInmGBmp2oYSz3jupitbpmrtzgWAxNFIMjRRDI-QXN1F83g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1237139812</pqid></control><display><type>article</type><title>Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)</title><source>EZB Electronic Journals Library</source><creator>N, Shylashree ; Venkata Narayana Reddy, D. ; Sridhar, V.</creator><creatorcontrib>N, Shylashree ; Venkata Narayana Reddy, D. ; Sridhar, V.</creatorcontrib><description>Elliptic Curve Cryptography (ECC) is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks. One of the most time consuming processes in ECC algorithm for encryption/decryption is the scalar multiplication, i. e. , KP, where P is the text which is on the elliptic curve. This paper examines that computation can be speeded up by using Ancient Indian Vedic Mathematics. Coding is done using Verilog-HDL and downloaded on target device as Virtex 5. Our proposed work is six times faster than the previous work when applied in point doubling using Spartan3 as target device.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/7643-0730</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Algorithms ; Cryptography ; Devices ; Indian ; Mathematical models ; Multiplication ; Scalars ; Texts</subject><ispartof>International journal of computer applications, 2012-01, Vol.49 (7), p.46-50</ispartof><rights>Copyright Foundation of Computer Science 2012</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1700-a245c70049e1c550a2d4c6ebf31e167888426958cb51c72fc67f2d2f2b9725b53</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>N, Shylashree</creatorcontrib><creatorcontrib>Venkata Narayana Reddy, D.</creatorcontrib><creatorcontrib>Sridhar, V.</creatorcontrib><title>Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)</title><title>International journal of computer applications</title><description>Elliptic Curve Cryptography (ECC) is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks. One of the most time consuming processes in ECC algorithm for encryption/decryption is the scalar multiplication, i. e. , KP, where P is the text which is on the elliptic curve. This paper examines that computation can be speeded up by using Ancient Indian Vedic Mathematics. Coding is done using Verilog-HDL and downloaded on target device as Virtex 5. Our proposed work is six times faster than the previous work when applied in point doubling using Spartan3 as target device.</description><subject>Algorithms</subject><subject>Cryptography</subject><subject>Devices</subject><subject>Indian</subject><subject>Mathematical models</subject><subject>Multiplication</subject><subject>Scalars</subject><subject>Texts</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNpdkTtrwzAUhU1poSHN0H8g6JIMbvWwLHsMIUkDCR36WI0sS4mCbLmSHcjcP16ZZCi9yz1wPw73cKLoEcFnijB8YWlCYsgIvIlGMGc0zrKM3f7R99HE-yMMQ3Kc5sko-lkqpYWWTQc2dWtkHRTvtG2AVeBdcMMd2PWm063R4nJQ1oGlMbrttACL3p0kWLhz29m94-3hDHqvmz2YN1fXptK8AV-yCvSOdwdZBxvhgT1JB9araTt7iO4UN15Ornscfa6WH4vXePu23izm21ggBmHMcUJFEEkukaAUclwlIpWlIkiilIV8SchEM1FSJBhWImUKV1jhMmeYlpSMo-nFt3X2u5e-K2rthTSGN9L2vggmKElzRnBAn_6hR9u7JnxXIEwYInmGBmp2oYSz3jupitbpmrtzgWAxNFIMjRRDI-QXN1F83g</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>N, Shylashree</creator><creator>Venkata Narayana Reddy, D.</creator><creator>Sridhar, V.</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120101</creationdate><title>Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)</title><author>N, Shylashree ; Venkata Narayana Reddy, D. ; Sridhar, V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1700-a245c70049e1c550a2d4c6ebf31e167888426958cb51c72fc67f2d2f2b9725b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Cryptography</topic><topic>Devices</topic><topic>Indian</topic><topic>Mathematical models</topic><topic>Multiplication</topic><topic>Scalars</topic><topic>Texts</topic><toplevel>online_resources</toplevel><creatorcontrib>N, Shylashree</creatorcontrib><creatorcontrib>Venkata Narayana Reddy, D.</creatorcontrib><creatorcontrib>Sridhar, V.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>N, Shylashree</au><au>Venkata Narayana Reddy, D.</au><au>Sridhar, V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p)</atitle><jtitle>International journal of computer applications</jtitle><date>2012-01-01</date><risdate>2012</risdate><volume>49</volume><issue>7</issue><spage>46</spage><epage>50</epage><pages>46-50</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>Elliptic Curve Cryptography (ECC) is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks. One of the most time consuming processes in ECC algorithm for encryption/decryption is the scalar multiplication, i. e. , KP, where P is the text which is on the elliptic curve. This paper examines that computation can be speeded up by using Ancient Indian Vedic Mathematics. Coding is done using Verilog-HDL and downloaded on target device as Virtex 5. Our proposed work is six times faster than the previous work when applied in point doubling using Spartan3 as target device.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/7643-0730</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0975-8887 |
| ispartof | International journal of computer applications, 2012-01, Vol.49 (7), p.46-50 |
| issn | 0975-8887 0975-8887 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671469732 |
| source | EZB Electronic Journals Library |
| subjects | Algorithms Cryptography Devices Indian Mathematical models Multiplication Scalars Texts |
| title | Efficient Implementation of Scalar Multiplication for Elliptic Curve Cryptography using Ancient Indian Vedic Mathematics over GF(p) |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T22%3A29%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20Implementation%20of%20Scalar%20Multiplication%20for%20Elliptic%20Curve%20Cryptography%20using%20Ancient%20Indian%20Vedic%20Mathematics%20over%20GF(p)&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=N,%20Shylashree&rft.date=2012-01-01&rft.volume=49&rft.issue=7&rft.spage=46&rft.epage=50&rft.pages=46-50&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/7643-0730&rft_dat=%3Cproquest_cross%3E2839086121%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1237139812&rft_id=info:pmid/&rfr_iscdi=true |