Results 31 to 40 of about 2,168 (195)
Engel p-adic Isogeny-based Cryptography over Laurent Series: Foundations, Security, and an ESP32 Implementation [PDF]
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.
Ilias Cherkaoui, Indrakshi Dey
openalex +3 more sources
Optimization of isogeny computation algorithms for post-quantum cryptography
Scientific AfricanIsogeny-based cryptography has emerged as a strong candidate for post-quantum security due to the believed hardness of finding isogenies between supersingular elliptic curves.
Mohammed El Baraka, Siham Ezzouak
doaj +3 more sources
Machine learning for moduli space of genus two curves and an application to isogeny based cryptography [PDF]
Journal of Algebraic CombinatoricsWe use machine learning to study the moduli space of genus two curves, specifically focusing on detecting whether a genus two curve has $(n, n)$-split Jacobian. Based on such techniques, we observe that there are very few rational moduli points with small weighted moduli height and $(n, n)$-split Jacobian for $n=2, 3, 5$.
Elira Shaska, Tony Shaska
openalex +4 more sources
In this paper, we describe an algorithm to compute chains of (2, 2)-isogenies between products of elliptic curves in the theta model. The description of the algorithm is split into various subroutines to allow for a precise field operation counting. We present a constant time implementation of our algorithm in Rust and an alternative implementation in ...
Pierrick Dartois +3 more
openalex +4 more sources
On the foundations of supersingular isogeny-based cryptography
The emergence of quantum computers constitutes a challenge for cryptography; we need to develop new computational problems that are presumably hard for quantum computers, together with new schemes relying on them. Post-quantum cryptography is the domain of research investigating schemes resistant to quantum adversaries.In this thesis, we explore the ...
Arthur Herlédan Le Merdy
+6 more sources
Explicit addition formulae on hyperelliptic curves of genus 2 for isogeny-based cryptography
JSIAM LettersSummary: Some isogeny-based cryptosystems use addition and doubling on the Jacobian over genus-2 sextic and non-monic hyperelliptic curves. In this study, we generalized some formulae for quintic and monic curves to sextic curves using projective coordinates and then compared them.
Kaito Sato +2 more
openalex +4 more sources
Journal of Machine and ComputingThe rise of cloud computing has changed how individuals and organizations store and communicate data, but it additionally caused significant concerns about information security and confidentiality. In order to improve data protection and allow covert communication in cloud environments, this research suggests a unique approach that combines spread ...
D. Shivaramakrishna, M. Nagaratna
openalex +2 more sources
How to Compute an Isogeny on the Extended Jacobi Quartic Curves? [PDF]
International Journal of Electronics and Telecommunications, 2022 Computing isogenies between elliptic curves is a significant part of post-quantum cryptography with many practical applications (for example, in SIDH, SIKE, B-SIDH, or CSIDH algorithms).
Łukasz Dzierzkowski, Michał Wroński
doaj +1 more source
Dual Isogenies and Their Application to Public-Key Compression for Isogeny-Based Cryptography
, 2019 The isogeny-based protocols SIDH and SIKE have received much attention for being post-quantum key agreement candidates that retain relatively small keys. A recent line of work has proposed and further improved compression of public keys, leading to the inclusion of public-key compression in the SIKE proposal for Round 2 of the NIST Post-Quantum ...
Michael Naehrig, Joost Renes
openalex +3 more sources