Results 161 to 170 of about 4,641 (196)
Some of the next articles are maybe not open access.

Fully Projective Radical Isogenies in Constant-Time

Lecture Notes in Computer Science, 2022
Jesús-Javier Chi-Domínguez   +1 more
semanticscholar   +3 more sources

Computing Supersingular Isogenies on Kummer Surfaces [PDF]

open access: yesLecture Notes in Computer Science, 2018
We apply Scholten\u27s construction to give explicit isogenies between the Weil restriction of supersingular Montgomery curves with full rational 2-torsion over $GF(p^2)$ and corresponding abelian surfaces over $GF(p)$. Subsequently, we show that isogeny-
Craig Costello
exaly   +3 more sources

Horizontal isogeny theorems

form, 2002
Summary: Let \(K\) be a field which is finitely generated over its prime field. Consider elliptic curves \(E\) and \(E'\) defined over \(K\). Suppose there exists \(c\geq 1\) and a set \(\Lambda\) of prime numbers such that \([K(E_l,E_l'): K(E_l)\cap K(E_l')]\leq c\) for all \(l\in\Lambda\).
Frey, Gerhard, Jarden, Moshe
openaire   +2 more sources

Leveled Isogeny Problems with Hints

We define and analyze the Leveled Isogeny Problem with Hints (LIPH), which is a generalization of the Isogeny Problem with Level Structure first introduced by De Feo, Fouotsa and Panny at EUROCRYPT’24. In a LIPH instance, we are tasked to recover a secret isogeny φ$$\varphi $$ given masked torsion point images M·(φ(P),φ(Q))⊤$$M\cdot (\varphi (P ...
Subham Das   +3 more
openaire   +2 more sources

Verifiable Isogeny Walks: Towards an Isogeny-Based Postquantum VDF

2022
Jorge Chávez-Saab   +2 more
openaire   +2 more sources

The Isogeny Theorems

1987
We return to p-adic representations. Let A be an elliptic curve defined over K. We take points of A in a fixed algebraic closure Ka. We have the p-adic spaces T p (A) and V p (A) over Z p and Q p respectively.
openaire   +1 more source

A Post-Quantum Round-Optimal Oblivious PRF from Isogenies

IACR Cryptology ePrint Archive, 2023
Andrea Basso
semanticscholar   +1 more source

Schoof's algorithm and isogeny cycles

1994
The heart of Schoof's algorithm for computing the cardinality m of an elliptic curve over a finite field is the computation of m modulo small primes l. Elkies and Atkin have designed practical improvements to the basic algorithm, that make use of “good” primes l. We show how to use powers of good primes in an efficient way.
Jean Marc Couveignes, François Morain
openaire   +1 more source

A Lower Bound on the Length of Signatures Based on Group Actions and Generic Isogenies

IACR Cryptology ePrint Archive, 2023
D. Boneh, Jiaxin Guan, Mark Zhandry
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy