The elliptic curve discrete logarithm problem (ECDLP) lies at the heart of modern public-key cryptography. It concerns the challenge of determining an unknown scalar multiplier given two points on an ...

This symposium focuses on research topics related to design and analysis of efficient algorithms and data structures for discrete problems. The scope includes theoretical analysis, as well as ...

A search problem refers to the task of finding a solution within some space of possible options, and that space could be made up of discrete steps or continuously varying values. For example, solving ...