Engel p-adic Isogeny-based Cryptography over Laurent Series: Foundations, Security, and an ESP32 Implementation
Ilias Cherkaoui, Indrakshi Dey

TL;DR
This paper introduces a novel p-adic Laurent series-based isogeny cryptography framework that achieves compact keys and efficient microcontroller implementation, advancing IoT security against quantum threats.
Contribution
It presents the first isogeny scheme using Engel expansions over p-adic Laurent series, enabling compact keys and efficient embedded implementation.
Findings
Public keys of 1.1 - 16.9 kbits achieved
Engel arithmetic enables efficient microcontroller operations
Framework enhances IoT security against quantum attacks
Abstract
Securing the Internet of Things (IoT) against quantum attacks requires public-key cryptography that (i) remains compact and (ii) runs efficiently on microcontrollers, capabilities many post-quantum (PQ) schemes lack due to large keys and heavy arithmetic. We address both constraints simultaneously with, to our knowledge, the first-ever isogeny framework that encodes super-singular elliptic-curve isogeny data via novel Engel expansions over the p-adic Laurent series. Engel coefficients compress torsion information, thereby addressing the compactness constraint, yielding public keys of ~1.1 - 16.9 kbits preserving the hallmark small sizes of isogeny systems. Engel arithmetic is local and admits fixed-precision p-adic operations, enabling micro-controller efficiency with low-memory, branch-regular kernels suitable for embedded targets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Polynomial and algebraic computation · advanced mathematical theories
