◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Katherine E. Stange

35 papers hereh-index 17821 citations59 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author9
  • middle author8
  • last author17

Across the 34 of 35 papers where every author was matched, so the position is known.

fields
  • math.NT28
  • cs.CR3
  • cs.GT2
  • math.HO2
same name
  • Katherine E. Stange — 3 papers, h 1
  • Katherine E. Stange — 1 paper
  • Katherine E. Stange — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20072026
most citedAmicable pairs and aliquot cycles for elliptic curves

33 citations · 218 across the 26 of their papers we have counts for

collaborators
Showing 2022Show all

4 papers · 1 filter

math.NT2022

Factoring using multiplicative relations modulo n: a subexponential algorithm inspired by the index calculus

Katherine E. Stange

We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdeter…

math.NT2022★ 11 cited

Orientations and cycles in supersingular isogeny graphs

Sarah Arpin, Mingjie Chen, Kristin E. Lauter +3

The paper concerns several theoretical aspects of oriented supersingular ℓ-isogeny volcanoes and their relationship to closed walks in the supersingular ℓ-isogeny graph.…

math.NT2022★ 1 cited

Failing to hash into supersingular isogeny graphs

Jeremy Booher, Ross Bowden, Javad Doliskani +12

An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equation…

math.NT2022

Orienteering with one endomorphism

Sarah Arpin, Mingjie Chen, Kristin E. Lauter +3

In supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.