Compression for trace zero points on twisted Edwards curves
This work addresses a domain-specific problem in cryptography, offering incremental improvements for efficient data storage and transmission in elliptic curve-based systems.
The authors tackled the problem of compressing elements in trace zero subgroups of twisted Edwards curves by proposing two optimal representations and efficient compression/decompression algorithms, comparing their efficiency with similar algorithms on Weierstrass form curves.
We propose two optimal representations for the elements of trace zero subgroups of twisted Edwards curves. For both representations, we provide efficient compression and decompression algorithms. The efficiency of the algorithm is compared with the efficiency of similar algorithms on elliptic curves in Weierstrass form.