International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

POKÉ: A Compact and Efficient PKE from Higher-dimensional Isogenies

Authors:
Andrea Basso , IBM Research Zurich
Luciano Maino , University of Bristol
Download:
Search ePrint
Search Google
Conference: EUROCRYPT 2025
Abstract: We introduce a new PKE protocol, POKE, 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, while the second allows us to obtain a shared secret even when all curves in the commutative diagram are known. The resulting protocol is compact, while extremely efficient. We provide a proof-of-concept implementation in SageMath of POKE that shows encryption and decryption taking about a hundred milliseconds at security level I: POKE is thus the most efficient encryption protocol from isogenies, and it outperforms existing protocols by more than an order of magnitude.
BibTeX
@inproceedings{eurocrypt-2025-35146,
  title={POKÉ: A Compact and Efficient PKE from Higher-dimensional Isogenies},
  publisher={Springer-Verlag},
  author={Andrea Basso and Luciano Maino},
  year=2025
}