Multiple Point Compression on Elliptic Curves

Abstract

The 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