default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatherine E. Stange
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Jeremy Booher
, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to Hash Into Supersingular Isogeny Graphs. Comput. J. 67(8): 2702-2719 (2024)- [i27]Joseph Macula, Katherine E. Stange:
Extending class group action attacks via sesquilinear pairings. CoRR abs/2406.10440 (2024) - [i26]Joseph Macula, Katherine E. Stange:
Extending class group action attacks via pairings. IACR Cryptol. ePrint Arch. 2024: 880 (2024) - 2022
- [j5]Edmund Harriss, Katherine E. Stange, Steve Trettel:
Algebraic Number Starscapes. Exp. Math. 31(4): 1098-1149 (2022) - [i25]Sarah Arpin, Mingjie Chen, Kristin E. Lauter, Renate Scheidler, Katherine E. Stange, Ha T. N. Tran:
Orienteering with one endomorphism. CoRR abs/2201.11079 (2022) - [i24]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. CoRR abs/2205.00135 (2022) - [i23]Sarah Arpin, Mingjie Chen, Kristin E. Lauter, Renate Scheidler, Katherine E. Stange, Ha T. N. Tran:
Orientations and cycles in supersingular isogeny graphs. CoRR abs/2205.03976 (2022) - [i22]Katherine E. Stange:
Factoring using multiplicative relations modulo n: a subexponential algorithm inspired by the index calculus. CoRR abs/2211.06821 (2022) - [i21]Sarah Arpin, Mingjie Chen, Kristin E. Lauter, Renate Scheidler, Katherine E. Stange, Ha T. N. Tran:
Orienteering with one endomorphism. IACR Cryptol. ePrint Arch. 2022: 98 (2022) - [i20]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. IACR Cryptol. ePrint Arch. 2022: 518 (2022) - [i19]Sarah Arpin, Mingjie Chen, Kristin E. Lauter, Renate Scheidler, Katherine E. Stange, Ha T. N. Tran:
Orientations and cycles in supersingular isogeny graphs. IACR Cryptol. ePrint Arch. 2022: 562 (2022) - [i18]Katherine E. Stange:
Factoring using multiplicative relations modulo n: a subexponential algorithm inspired by the index calculus. IACR Cryptol. ePrint Arch. 2022: 1588 (2022) - 2021
- [j4]Katherine E. Stange:
Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum-Kalai-Wasserman Algorithm. SIAM J. Appl. Algebra Geom. 5(2): 366-387 (2021) - [c5]Victoria de Quehen, Péter Kutas, Chris Leonardi, Chloe Martindale, Lorenz Panny, Christophe Petit, Katherine E. Stange:
Improved Torsion-Point Attacks on SIDH Variants. CRYPTO (3) 2021: 432-470 - 2020
- [i17]Péter Kutas, Chloe Martindale, Lorenz Panny, Christophe Petit, Katherine E. Stange:
Weak instances of SIDH variants under improved torsion-point attacks. CoRR abs/2005.14681 (2020) - [i16]Péter Kutas, Chloe Martindale, Lorenz Panny, Christophe Petit, Katherine E. Stange:
Weak instances of SIDH variants under improved torsion-point attacks. IACR Cryptol. ePrint Arch. 2020: 633 (2020)
2010 – 2019
- 2019
- [i15]Katherine E. Stange:
Algebraic aspects of solving Ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm. CoRR abs/1902.07140 (2019) - [i14]Katherine E. Stange:
Algebraic aspects of solving Ring-LWE, including ring-based improvements in the Blum-Kalai-Wasserman algorithm. IACR Cryptol. ePrint Arch. 2019: 183 (2019) - 2017
- [j3]Hao Chen, Kristin E. Lauter, Katherine E. Stange:
Attacks on the Search RLWE Problem with Small Errors. SIAM J. Appl. Algebra Geom. 1(1): 665-682 (2017) - [i13]Hao Chen, Kristin E. Lauter, Katherine E. Stange:
Security considerations for Galois non-dual RLWE families. CoRR abs/1710.03316 (2017) - [i12]Hao Chen, Kristin E. Lauter, Katherine E. Stange:
Attacks on the Search-RLWE problem with small errors. CoRR abs/1710.03739 (2017) - 2016
- [c4]Hao Chen, Kristin E. Lauter, Katherine E. Stange:
Security Considerations for Galois Non-dual RLWE Families. SAC 2016: 443-462 - [i11]Hao Chen, Kristin E. Lauter, Katherine E. Stange:
Vulnerable Galois RLWE Families and Improved Attacks. IACR Cryptol. ePrint Arch. 2016: 193 (2016) - 2015
- [c3]Yara Elias, Kristin E. Lauter, Ekin Ozman, Katherine E. Stange:
Provably Weak Instances of Ring-LWE. CRYPTO (1) 2015: 63-92 - [i10]Yara Elias, Kristin E. Lauter, Ekin Ozman, Katherine E. Stange:
Provably weak instances of Ring-LWE. CoRR abs/1502.03708 (2015) - [i9]Yara Elias, Kristin E. Lauter, Ekin Ozman, Katherine E. Stange:
Ring-LWE Cryptography for the Number Theorist. CoRR abs/1508.01375 (2015) - [i8]Yara Elias, Kristin E. Lauter, Ekin Ozman, Katherine E. Stange:
Provably weak instances of Ring-LWE. IACR Cryptol. ePrint Arch. 2015: 106 (2015) - [i7]Yara Elias, Kristin E. Lauter, Ekin Ozman, Katherine E. Stange:
Ring-LWE Cryptography for the Number Theorist. IACR Cryptol. ePrint Arch. 2015: 758 (2015) - [i6]Hao Chen, Kristin E. Lauter, Katherine E. Stange:
Attacks on Search RLWE. IACR Cryptol. ePrint Arch. 2015: 971 (2015) - 2012
- [j2]Lionel Levine, Katherine E. Stange:
How to Make the Most of a Shared Meal: Plan the Last Bite First. Am. Math. Mon. 119(7): 550-565 (2012) - 2011
- [j1]Joseph H. Silverman, Katherine E. Stange:
Amicable Pairs and Aliquot Cycles for Elliptic Curves. Exp. Math. 20(3): 329-357 (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 - [i5]Lionel Levine, Katherine E. Stange:
How to make the most of a shared meal: plan the last bite first. CoRR abs/1104.0961 (2011) - [i4]Lionel Levine, Scott Sheffield, Katherine E. Stange:
A duality principle for selection games. CoRR abs/1110.2712 (2011)
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
- [c2]Kristin E. Lauter, Katherine E. Stange:
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences. Selected Areas in Cryptography 2008: 309-327 - [i2]Kristin E. Lauter, Katherine E. Stange:
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences. IACR Cryptol. ePrint Arch. 2008: 99 (2008) - 2007
- [c1]Katherine E. Stange:
The Tate Pairing Via Elliptic Nets. Pairing 2007: 329-348 - 2006
- [i1]Katherine E. Stange:
The Tate Pairing via Elliptic Nets. IACR Cryptol. ePrint Arch. 2006: 392 (2006)
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-10-07 21:17 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:
