Orienteering with One Endomorphism

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 known that a small degree endomorphism enables polynomial-time path-finding and endomorphism ring computation (in: Love...

Descripción completa

Detalles Bibliográficos
Autores principales: Arpin, Sarah, Chen, Mingjie, Lauter, Kristin E., Scheidler, Renate, Stange, Katherine E., Tran, Ha T. N.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2023
Materias:
Original Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10533648/
https://www.ncbi.nlm.nih.gov/pubmed/37780079
http://dx.doi.org/10.1007/s44007-023-00053-2

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10533648/
https://www.ncbi.nlm.nih.gov/pubmed/37780079
http://dx.doi.org/10.1007/s44007-023-00053-2

Ejemplares similares