Paper 2025/1693
Quasi-perfect (de)compression of elliptic curve points in the highly $2$-adic scenario
Abstract
In this short note, a new laconic, secure, and efficient (de)compression method is provided for points of any elliptic curve over any highly $2$-adic finite field of large characteristic. Such fields are ubiquitous in modern elliptic curve cryptography, whereas they severely slow down the conventional $x$-coordinate (de)compression technique. In comparison with the current state of the art in the given research direction, the new method requires neither complicated mathematical formulas nor conditions on the curve, nor reliable pseudo-random generators. Thereby, the present work is universal and much more implementation-friendly, which justifies its existence, despite the absence of interesting mathematics behind it.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- (D)DoS attackselliptic curve cryptographyhighly 2-adic finite fieldsMüller's algorithmpoint (de)compression
- Contact author(s)
-
dimitri koshelev @ gmail com
jordi pujolas @ udl cat - History
- 2026-03-20: last of 3 revisions
- 2025-09-17: received
- See all versions
- Short URL
- https://ia.cr/2025/1693
- License
-
CC0
BibTeX
@misc{cryptoeprint:2025/1693,
author = {Dimitri Koshelev and Jordi Pujolàs},
title = {Quasi-perfect (de)compression of elliptic curve points in the highly $2$-adic scenario},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1693},
year = {2025},
url = {https://eprint.iacr.org/2025/1693}
}
