default search action
Kirsten Eisenträger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i7]Kirsten Eisenträger, Gabrielle Scullard:
Connecting Kani's Lemma and path-finding in the Bruhat-Tits tree to compute supersingular endomorphism rings. CoRR abs/2402.05059 (2024) - 2023
- [j1]Kirsten Eisenträger
, Russell Miller
A Topological Approach to Undefinability in Algebraic Extensions of. Bull. Symb. Log. 29(4): 626-655 (2023)
2010 – 2019
- 2018
- [c7]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter, Travis Morrison
Supersingular Isogeny Graphs and Endomorphism Rings: Reductions and Solutions. EUROCRYPT (3) 2018: 329-368 - [i6]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter, Travis Morrison, Christophe Petit:
Supersingular isogeny graphs and endomorphism rings: reductions and solutions. IACR Cryptol. ePrint Arch. 2018: 371 (2018) - 2017
- [i5]Kirsten Eisenträger, Sean Hallgren, Travis Morrison:
On the Hardness of Computing Endomorphism Rings of Supersingular Elliptic Curves. IACR Cryptol. ePrint Arch. 2017: 986 (2017) - 2014
- [c6]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter:
Weak Instances of PLWE. Selected Areas in Cryptography 2014: 183-194 - [c5]Kirsten Eisenträger, Sean Hallgren, Alexei Y. Kitaev, Fang Song:
A quantum algorithm for computing the unit group of an arbitrary degree number field. STOC 2014: 293-302 - [i4]Kirsten Eisenträger, Sean Hallgren, Kristin E. Lauter:
Weak Instances of PLWE. IACR Cryptol. ePrint Arch. 2014: 784 (2014) - 2011
- [p1]Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske:
Pairings on Hyperelliptic Curves. WIN - Women in Numbers 2011: 87-120 - 2010
- [c4]Kirsten Eisenträger, Sean Hallgren:
Algorithms for Ray Class Groups and Hilbert Class Fields. SODA 2010: 471-483
2000 – 2009
- 2009
- [i3]Jennifer S. Balakrishnan, Juliana Belding, Sarah Chisholm, Kirsten Eisenträger, Katherine E. Stange, Edlyn Teske:
Pairings on hyperelliptic curves. CoRR abs/0908.3731 (2009) - 2008
- [c3]Kirsten Eisenträger, Dimitar Jetchev, Kristin E. Lauter:
Computing the Cassels Pairing on Kolyvagin Classes in the Shafarevich-Tate Group. Pairing 2008: 113-125 - 2004
- [c2]Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery:
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves. ANTS 2004: 169-183 - 2003
- [c1]Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery:
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. CT-RSA 2003: 343-354 - [i2]Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery:
Improved Weil and Tate pairings for elliptic and hyperelliptic curves. IACR Cryptol. ePrint Arch. 2003: 242 (2003) - 2002
- [i1]Kirsten Eisenträger, Kristin E. Lauter, Peter L. Montgomery:
An Efficient Procedure to Double and Add Points on an Elliptic Curve. IACR Cryptol. ePrint Arch. 2002: 112 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: