In this paper, we propose a practical signature scheme based on the alternating trilinear
form equivalence problem. Our scheme is inspired by the Goldreich-Micali-Wigderson's zero …

There is a recent trend in cryptography to construct protocols based on the hardness of
computing isogenies between supersingular elliptic curves. Two prominent examples are …

In this paper, we present a new quantum-resistant weak Verifiable Delay Function based on
a purely algebraic construction. Its delay depends on computing a large-degree isogeny …

We provide a new identification protocol and new signature schemes based on isogeny
problems. Our identification protocol relies on the hardness of the endomorphism ring …

We introduce a category of 𝓞-oriented supersingular elliptic curves and derive properties of
the associated oriented and nonoriented ℓ-isogeny supersingular isogeny graphs. As an …

We present Séta (To be pronounced [ʃe: tɒ] meaning “walk” in Hungarian.), a new family of
public-key encryption schemes with post-quantum security based on isogenies of …

We present an efficient key recovery attack on the Supersingular Isogeny Diffie–Hellman
protocol (SIDH). The attack is based on Kani's “reducibility criterion” for isogenies from …

We propose a new suite of algorithms that significantly improve the performance of
supersingular isogeny Diffie-Hellman (SIDH) key exchange. Subsequently, we present a full …

We show that finding an efficiently computable injective homomorphism from the XTR
subgroup into the group of points over GF (p 2) of a particular type of supersingular elliptic …

Currently, we rely on cryptographic algorithms such as elliptic curve cryptosystems (ECCs)
as basic building blocks to secure the communication in the IoT. However, public key …