Paper 2024/624 Original: eprint.iacr.org/2024/624 ↗
POKÉ: A Compact and Efficient PKE from Higher-dimensional Isogenies
Abstract
We introduce a new PKE protocol, POKÉ, based on isogenies of unknown degree. The protocol relies on two new techniques: the first constructs an SIDH square while also working with higher-dimensional representations, whereas the second allows us to obtain a shared secret even when all curves in the commutative diagram are known. The resulting protocol is compact and extremely efficient. We provide a proof-of-concept implementation in SageMath of POKÉ that shows encryption and decryption taking about a hundred milliseconds at security level I: POKÉ is thus the most efficient encryption protocol from isogenies, and it outperforms existing protocols by more than an order of magnitude.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-02-24: last updated
- 2024-04-22: published
- Short URL
- https://ia.cr/2024/624
- License
- https://creativecommons.org/licenses/by-nc-sa/4.0/
BibTeX
@misc{cryptoeprint:2024/624,
author = {Andrea Basso and Luciano Maino},
title = {POKÉ: A Compact and Efficient PKE from Higher-dimensional Isogenies},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/624},
year = {2024},
url = {https://eprint.iacr.org/2024/624}
}