This paper explores a new way of instantiating isogeny-based cryptography in which parties
can work in both the (p+ 1)(p+ 1)-torsion of a set of supersingular curves and in the (p-1)(p …

The SHA-1 hash function was designed in 1995 and has been widely used during two
decades. A theoretical collision attack was first proposed in 2004 [WYY05], but due to its …

An oblivious PRF, or OPRF, is a protocol between a client and a server, where the server
has a key k for a secure pseudorandom function F, and the client has an input x for the …

Recently, a new code based signature scheme, called LESS, was proposed with three
concrete instantiations, each aiming to provide 128 bits of classical security 3. Two …

The main contribution of this work is an optimized implementation of the van Oorschot-
Wiener (vOW) parallel collision finding algorithm. As is typical for cryptanalysis against …

Let A/F _p and A'/F _p be superspecial principally polarized abelian varieties of dimension
g> 1. For any prime ℓ ≠ p, we give an algorithm that finds a path ϕ: A → A'in the (ℓ,\dots, ℓ) …

Supersingular Isogeny Key Exchange for Beginners | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …

ABSTRACT Elliptic Curve Cryptography (ECC) is capable of constructing public-key
cryptosystems. Specifically, the security of the ECC minimizes to testing the ability to handle …

Inserting backdoors in encryption algorithms has long seemed like a very interesting, yet
difficult problem. Most attempts have been unsuccessful for symmetric-key primitives so far …

We propose two heuristic polynomial memory collision finding algorithms for the low
Hamming weight discrete logarithm problem in any abelian group G. The first one is a direct …