Oct. 9, 2023, 1:10 a.m. | Ansari Abdullah, Ayan Mahalanobis

cs.CR updates on arXiv.org arxiv.org

The elliptic curve discrete logarithm problem is of fundamental importance in
public-key cryptography. It is in use for a long time. Moreover, it is an
interesting challenge in computational mathematics. Its solution is supposed to
provide interesting research directions.


In this paper, we explore ways to solve the elliptic curve discrete logarithm
problem. Our results are mostly computational. However, it seems, the methods
that we develop and directions that we pursue can provide a potent attack on
this problem. This …

challenge computational cryptography curve elliptic key mathematics minors problem public public-key cryptography research solution

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Data & Security Engineer Lead

@ LiquidX | Singapore, Central Singapore, Singapore

IT and Cyber Risk Control Lead

@ GXS Bank | Singapore - OneNorth

Consultant Senior en Gestion de Crise Cyber et Continuité d’Activité H/F

@ Hifield | Sèvres, France

Cyber Security Analyst (Weekend 1st Shift)

@ Fortress Security Risk Management | Cleveland, OH, United States

Senior Manager, Cybersecurity

@ BlueTriton Brands | Stamford, CT, US