二进制Edwards曲线上的点压缩算法

Point Compression Schemes on Binary Edwards Curves

探讨二进制Edwards曲线上的点压缩算法。分别给出了二进制Edwards曲线的单点压缩算法和两点压缩算法。平均压缩点带宽为nbit和1.5n-1 bit,平均恢复点开销为I+0.5M+S和1.5I+M+S.通过与对其他类型曲线上的点压缩算法对比,此点压缩算法在压缩带宽和恢复点开销两方面都有相应的优势。

Schemes of point compression on binary Edwards curves were considered. Two different levels of com-pression, namely one point and double point, were proposed respectively, per bandwidth of compression are n bit and 1.5 n-1 bit, and per cost of recover are I ＋ S ＋ O. 5 M and 1.51 ＋ M ＋ S. Compared with the point compres-sion algorithms of other forms of elliptic curves, this approach has a higher performance in bandwidth and cost re-spectively.