Exploring SIDH-Based Signature Parameters

Basso, Andrea; Chen, Mingjie; Fouotsa, Tako Boris; Kutas, Péter; Laval, Abel; Marco, Laurane; Saah, Gustave Tchoffo

doi:10.1007/978-3-031-54770-6_17

Lecture Notes in Computer Science

2024

DOI: 10.1007/978-3-031-54770-6_17

|View full text |Cite

Exploring SIDH-Based Signature Parameters

Andrea Basso,

Mingjie Chen,

Tako Boris Fouotsa

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On random sampling of supersingular elliptic curves

Mula,

Murru,

Pintore

2024

Annali di Matematica

View full text Add to dashboard Cite

We consider the problem of sampling random supersingular elliptic curves over finite fields of cryptographic size (SRS problem). The currently best-known method combines the reduction of a suitable complex multiplication (CM) elliptic curve and a random walk over some supersingular isogeny graph. Unfortunately, this method is not suitable when the endomorphism ring of the generated curve needs to be hidden, like in some cryptographic applications. This motivates a stricter version of the SRS problem, requiring that the sampling algorithm gives no information about the endomorphism ring of the output curve (cSRS problem). In this work we formally define the SRS and cSRS problems, which are both of theoretical interest. We discuss the relevance of the two problems for cryptographic applications, and we provide a self-contained survey of the known approaches to solve them. Those for the cSRS problem have exponential complexity in the characteristic of the base finite field (since they require computing and finding roots of polynomials of large degree), leaving the problem open. In the second part of the paper, we propose and analyse some alternative techniques—based either on the Hasse invariant or division polynomials—and we explain the reasons why they do not readily lead to efficient cSRS algorithms, but they may open promising research directions.

show abstract

On random sampling of supersingular elliptic curves

Mula,

Murru,

Pintore

2024

Annali di Matematica

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Exploring SIDH-Based Signature Parameters

Cited by 1 publication

References 46 publications

On random sampling of supersingular elliptic curves

On random sampling of supersingular elliptic curves

Contact Info

Product

Resources

About