Low Depth Phase Oracle Using a Parallel Piecewise Circuit

Autor: Sun, Zhu, Boyd, Gregory, Cai, Zhenyu, Jnane, Hamza, Koczor, Balint, Meister, Richard, Minko, Romy, Pring, Benjamin, Benjamin, Simon C., Stamatopoulos, Nikitas

We explore the important task of applying a phase $exp(i f(x))$ to a computational basis state $\left| x \right>$. The closely related task of rotating a target qubit by an angle depending on $f(x)$ is also studied. Such operations are key in many qu

Externí odkaz: http://arxiv.org/abs/2409.04587

A trade-off between classical and quantum circuit size for an attack against CSIDH

Autor: Biasse Jean-François, Bonnetain Xavier, Pring Benjamin, Schrottenloher André, Youmans William

Publikováno v: Journal of Mathematical Cryptology, Vol 15, Iss 1, Pp 4-17 (2020)

We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪). Let Δ = Disc(𝒪)

Externí odkaz: https://doaj.org/article/3f4a6b592a034dc7aa26d51735aee5df

Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES

Autor: Davenport, James H., Pring, Benjamin

Publikováno v: Davenport, J H & Pring, B 2021, Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES . in O Dunkelman, M J Jacobson, Jr. & C O’Flynn (eds), Selected Areas in Cryptography-27th International Conference, 2020, Revised Selected Papers . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12804 LNCS, Springer Science and Business Media Deutschland GmbH, Germany, pp. 360-384, 27th International Conference on Selected Areas in Cryptography, SAC 2020, Virtual, Online, 21/10/20 . https://doi.org/10.1007/978-3-030-81652-0_14

In this paper we demonstrate that the overheads (ancillae qubits/time/number of gates) involved with implementing quantum oracles for a generic key-recovery attack against block-ciphers using quantum search techniques can be reduced. In particular, i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1378::516521c2fb1026df84aaf118cdec320d
https://purehost.bath.ac.uk/ws/files/226030255/AuthorsFinalDavenport_Pring.pdf

Parallelism strategies for the tuneable golden-claw finding problem

Autor: Azarderakhsh, Reza, Biasse, Jean-François, El Khatib, Rami, Langenberg, Brandon, Pring, Benjamin

Publikováno v: International Journal of Computer Mathematics: Computer Systems Theory; October 2021, Vol. 6 Issue: 4 p337-363, 27p

A trade-off between classical and quantum circuit size for an attack against CSIDH.

Autor: Biasse, Jean-François, Bonnetain, Xavier, Pring, Benjamin, Schrottenloher, André, Youmans, William

Publikováno v: Journal of Mathematical Cryptology; 2021, Vol. 15 Issue 1, p4-17, 14p