Multiple Point Compression on Elliptic Curves

Simple item page
dc.contributor.authorOtemissov, Adilet
dc.date.accessioned2016-06-14T02:48:58Z
dc.date.available2016-06-14T02:48:58Z
dc.date.issued2015
dc.description.abstractThe paper aims at developing new point compression algorithms which are useful in mobile communication systems where Elliptic Curve Cryptography is employed to achieve secure data storage and transmission. Compression algorithms allow elliptic curve points to be represented in the form that balances the usage of memory and computational power. The two- and three-point compression algorithms developed by Khabbazian, Gulliver and Bhargava [4] are reviewed and extended to generic cases of four and five points. The proposed methods use only basic operations (multiplication, division, etc.) and avoids square root finding. In addition, a new two-point compression method which is heavy in compression phase and light in decompression is developed.ru_RU
dc.identifier.citationOtemissov Adilet. 2015. Multiple Point Compression on Elliptic Curves. School of Science and Technology. Mathematics Department. http://nur.nu.edu.kz/handle/123456789/1633ru_RU
dc.identifier.urihttp://nur.nu.edu.kz/handle/123456789/1633
dc.language.isoenru_RU
dc.publisherNazarbayev University School of Science and Technology
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/*
dc.subjectCapstone Projectru_RU
dc.subjectElliptic Curvesru_RU
dc.subjectElliptic Curve Cryptographyru_RU
dc.titleMultiple Point Compression on Elliptic Curvesru_RU
dc.typeCapstone Projectru_RU

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Adilet Otemissov_capstone_report.pdf
Size:
151.38 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
6.22 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Capstone Projects