<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/73970.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">73970</article-id>
<title-group>
<article-title>Fixed and variable Size Text Based Message Mapping Technique using ECC</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Muthukuru</surname><given-names>Dr. Jayabhaskar</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Sathyanarayana</surname><given-names>Prof. Bachala</given-names></name></contrib>
</contrib-group>
<aff id="aff1">INDIA, Sri Krishnadevaraya University</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2012-05-15">
<day>15</day>
<month>05</month>
<year>2012</year>
</pub-date>
<volume>12</volume>
<issue>3</issue>
<fpage>25</fpage>
<lpage>30</lpage>
<abstract><p>Elliptic Curve Cryptography recently gained a lot of attention in industry. The principal attraction of ECC compared to RSA is that it offers equal security for a smaller bit size, thereby reducing processing overhead. ECC is ideal for constrained environment such as pager, PDAs, cellular phones and smart cards. ECC Encryption and Decryption methods can only encrypt and decrypt a point on the curve and not messages. This paper presents the implementation of mapping of text message into multiple points on Elliptic Curve with an Initial Vector (IV) using ECC. Further it also includes the transformation of fixed and variable size word in source text on to Elliptic Curve. These proposed methods enhance the security of ECC with multi fold encryption.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>Elliptic Curve Cryptography</kwd>
<kwd>finite fields</kwd>
<kwd>Smart Cards</kwd>
<kwd>public key cryptography</kwd>
<kwd>discrete logarithm.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume12/4-Fixed-and-Variable-Size-Text-Based.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/fixed-and-variable-size-text-based-message-mapping-technique-using-ecc/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>Elliptic Curve Cryptography recently gained a lot of attention in industry. The principal attraction of ECC compared to RSA is that it offers equal security for a smaller bit size, thereby reducing processing overhead. ECC is ideal for constrained environment such as pager, PDAs, cellular phones and smart cards. ECC Encryption and Decryption methods can only encrypt and decrypt a point on the curve and not messages. This paper presents the implementation of mapping of text message into multiple points on Elliptic Curve with an Initial Vector (IV) using ECC. Further it also includes the transformation of fixed and variable size word in source text on to Elliptic Curve. These proposed methods enhance the security of ECC with multi fold encryption.</p>
</sec>
</body>
</article>