2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.CR2020★ 2 cited
In-place implementation of Quantum-Gimli
Lars Schlieper
We present an in-place implementation of the cryptographic permutation \textbf{Gimli}, a NIST round 2 candidate for lightweight cryptography, and provide an upper bound for the req…
cs.CR2019
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…
cs.CR2019
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…