Kirsten Eisenträger

Orcid: 0000-0002-1040-0097

According to our database1, Kirsten Eisenträger authored at least 13 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Connecting Kani's Lemma and path-finding in the Bruhat-Tits tree to compute supersingular endomorphism rings.
CoRR, 2024

2023
A Topological Approach to Undefinability in Algebraic Extensions of.
Bull. Symb. Log., December, 2023

2018
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
On the Hardness of Computing Endomorphism Rings of Supersingular Elliptic Curves.
IACR Cryptol. ePrint Arch., 2017

2014
A quantum algorithm for computing the unit group of an arbitrary degree number field.
Proceedings of the Symposium on Theory of Computing, 2014

Weak Instances of PLWE.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

2011
Pairings on Hyperelliptic Curves.
Proceedings of the WIN - Women in Numbers - Research Directions in Number Theory., 2011

2010
Algorithms for Ray Class Groups and Hilbert Class Fields.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Pairings on hyperelliptic curves
CoRR, 2009

2008
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group.
Proceedings of the Pairing-Based Cryptography, 2008

2004
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation.
Proceedings of the Topics in Cryptology, 2003

2002
An Efficient Procedure to Double and Add Points on an Elliptic Curve.
IACR Cryptol. ePrint Arch., 2002


  Loading...