Breaking SIDH in polynomial time

D Robert - Annual International Conference on the Theory and …, 2023 - Springer
Breaking SIDH in Polynomial Time | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart …

Effective pairings in isogeny-based cryptography

K Reijnders - … Conference on Cryptology and Information Security in …, 2023 - Springer
Pairings are useful tools in isogeny-based cryptography and have been used in SIDH/SIKE
and other protocols. As a general technique, pairings can be used to move problems about …

[PDF][PDF] The geometric interpretation of the Tate pairing and its applications

D Robert - 2023 - hal.science
While the Weil pairing is geometric, the Tate pairing is arithmetic: its value depends on the
base field considered. Nevertheless, the étale topology allows to interpret the Galois action …

[HTML][HTML] Jacobian coordinates on genus 2 curves

H Hisil, C Costello - Journal of Cryptology, 2017 - Springer
This paper presents a new projective coordinate system and new explicit algorithms which
together boost the speed of arithmetic in the divisor class group of genus 2 curves. The …

[HTML][HTML] Arithmetic on abelian and Kummer varieties

D Lubicz, D Robert - Finite Fields and Their Applications, 2016 - Elsevier
A Kummer variety is obtained as the quotient of an abelian variety by the automorphism (− 1)
acting on it. Kummer varieties can be seen as a higher dimensional generalisation of the x …

Computing separable isogenies in quasi-optimal time

D Lubicz, D Robert - LMS Journal of Computation and Mathematics, 2015 - cambridge.org
Let A be an abelian variety of dimension g together with a principal polarization ϕ: A→ ˆA
defined over a field k. Let l be an odd integer prime to the characteristic of k and let K be a …

Parallel Algorithms on Hyperelliptic Pairings Using Hyperelliptic Nets

C Chen, F Zhang - Australasian Conference on Information Security and …, 2024 - Springer
Pairings are useful tools in cryptography and efficient implementations play a critical role in
their usage, where Miller's algorithms are the main method for all pairings. As an alternative …

Constructing abelian surfaces for cryptography via Rosenhain invariants

C Costello, A Deines-Schartz, K Lauter… - LMS Journal of …, 2014 - cambridge.org
This paper presents an algorithm to construct cryptographically strong genus curves and
their Kummer surfaces via Rosenhain invariants and related Kummer parameters. The most …

Computational aspects of jacobians of hyperelliptic curves

A Dudeanu - 2016 - infoscience.epfl.ch
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem
(DLP) in finite groups whose group representation is not yet exploited. For such groups, the …

An analytic perspective of Weil reciprocity

J Cogdell, J Jorgenson, L Smajlović - Albanian Journal of …, 2023 - projecteuclid.org
In Cogdell et al., LMS Lecture Notes Series 459, 393–427 (2020), the authors proved a type
of Kronecker's limit formula associated to any divisor D on any smooth Kähler manifold X …