EconPapers    
Economics at your fingertips  
 

On the Search for Supersingular Elliptic Curves and Their Applications

Ismel Martinez-Diaz, Rashad Ali () and Muhammad Kamran Jamil
Additional contact information
Ismel Martinez-Diaz: Department of Mathematics, Universitat de Lleida, C/ Jaume II, 69, 25001 Lleida, Spain
Rashad Ali: Department of Mathematics, University of Trento, 38122 Trento, Italy
Muhammad Kamran Jamil: Department of Mathematics, Riphah International University, Lahore 54000, Pakistan

Mathematics, 2025, vol. 13, issue 2, 1-19

Abstract: Elliptic curves with the special quality known as supersingularity have gained much popularity in the rapidly developing field of cryptography. The conventional method of employing random search is quite ineffective in finding these curves. This paper analyzes the search of supersingular elliptic curves in the space of curves over F p 2 . We show that naive random search is unsuitable to easily find any supersingular elliptic curves when the space size is greater than 10 13 . We improve the random search using a necessary condition for supersingularity. As our main result, we define for the first time an objective function to measure the supersingularity in ordinary curves, and we apply local search and a genetic algorithm using that function. The study not only finds these supersingular elliptic curves but also investigates possible uses for them. These curves were used to create cycles inside the isogeny graph in one particular application. The research shows how the design of S-boxes may strategically use these supersingular elliptic curves. The key components of replacement, which is a fundamental step in the encryption process that shuffles and encrypts the data inside images, are S-boxes. This work represents a major advancement in effectively identifying these useful elliptic curves, eventually leading to their wider application and influence in the rapidly expanding field of cryptography.

Keywords: supersingular elliptic curves; metaheuristic; combinatorial optimization; isogeny graph cycles; S-box; image encryption (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/2/188/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/2/188/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:2:p:188-:d:1562724

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jmathe:v:13:y:2025:i:2:p:188-:d:1562724