Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Hidden Shift Problem"”.

  1. The non-injective hidden shift problem

    In this work, we mostly concentrate on the hidden shift problem for non-injective functions. It is worthwhile to know that the query complexity of the non-injective hidden shift problem is exponential in the worst case by the well known bounds on the unstructured search problem. Hence, we can make …

    waterloo Repository record for The non-injective hidden shift problem (opens in a new tab)

  2. Quantum algorithms for searching, resampling, and hidden shift problems

    … rejection sampling, and (3) the Boolean function hidden shift problem. The first two parts deal with generic techniques for constructing quantum algorithms, and the last part is on quantum algorithms for a specific algebraic problem. In the first part of this thesis we show how certain types of …

    waterloo Repository record for Quantum algorithms for searching, resampling, and hidden shift problems (opens in a new tab)

  3. Cryptanalysis of Isogeny-based Protocols in Genus 1 and 2

    … providing cryptosystems based on mathematical problems which are assumed to be hard for both classical and quantum computers. The most general of these isogeny-related problems, the pure isogeny problem, is the task of finding an isogeny between any two given supersingular elliptic curves. Many …

    birmingham Download PDF for Cryptanalysis of Isogeny-based Protocols in Genus 1 and 2 (opens in a new tab)