10 citations · 29 across the 5 of their papers we have counts for
6 papers
Relating non-local quantum computation to information theoretic cryptography
Rene Allerstorfer, Harry Buhrman, Alex May +2
Non-local quantum computation (NLQC) is a cheating strategy for position-verification schemes, and has appeared in the context of the AdS/CFT correspondence. Here, we connect NLQC…
Code-routing: a new attack on position verification
Joy Cree, Alex May
The cryptographic task of position verification attempts to verify one party's location in spacetime by exploiting constraints on quantum information and relativistic causality. A…
How Not to Protect Your IP -- An Industry-Wide Break of IEEE 1735 Implementations
Julian Speith, Florian Schweins, Maik Ender +3
Modern hardware systems are composed of a variety of third-party Intellectual Property (IP) cores to implement their overall functionality. Since hardware design is a globalized pr…
Noisy Simon Period Finding
Alexander May, Lars Schlieper, Jonathan Schwinger
Let be a Boolean function with period . It is well-known that Simon's algorithm finds in time polynomial in on q…
Better Sample -- Random Subset Sum in and its Impact on Decoding Random Linear Codes
Andre Esser, Alexander May
We propose a new heuristic algorithm for solving random subset sum instances , which play a crucial role in cryptographic constructions. O…
Quantum Period Finding is Compression Robust
Alexander May, Lars Schlieper
We study quantum period finding algorithms such as Simon and Shor (and its variants Ekerå-Håstad and Mosca-Ekert). For a periodic function these algorithms produce -- via some…