Claw finding algorithms using quantum walk

DOI10.1016/J.TCS.2009.08.030MaRDI QIDQ1034536zbMATH OpenOpenAlexFDO

Authors Seiichiro Tani

Publication date 6 November 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.08.030

zbMATH Keywords

query complexityquantum computingquantum walkoracle computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• An Improved Claw Finding Algorithm Using Quantum Walk
• A new quantum claw-finding algorithm for three functions
• scientific article; zbMATH DE number 5320343
• Computing and Combinatorics
• Quantum algorithms for the triangle problem

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5320343 (Why is no real title available?)
• scientific article; zbMATH DE number 5485493 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2038718 (Why is no real title available?)
• scientific article; zbMATH DE number 1776257 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Computing and Combinatorics
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Algorithms for Element Distinctness
• Quantum Algorithms for the Triangle Problem
• Quantum Query Complexity of Some Graph Problems
• Quantum Walk Algorithm for Element Distinctness
• Quantum cryptanalysis of hash and claw-free functions
• Quantum lower bounds for the collision and the element distinctness problems

Cited in

(26)

• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• The supersingular isogeny problem in genus 2 and beyond
• A note about claw function with a small range
• Quantum walk and its application domains: a systematic review
• A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies
• A new quantum claw-finding algorithm for three functions
• On the cost of computing isogenies between supersingular elliptic curves
• Hash functions from superspecial genus-2 curves using Richelot isogenies
• B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
• Computational problems in supersingular elliptic curve isogenies
• Improved classical cryptanalysis of SIKE in practice
• Algebraic approaches for solving isogeny problems of prime power degrees
• Faster cryptographic hash function from supersingular isogeny graphs
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Computing and Combinatorics
• Low memory attacks on small key CSIDH
• Efficient finite field multiplication for isogeny based post quantum cryptography
• An Improved Claw Finding Algorithm Using Quantum Walk
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Limonnitsa: making Limonnik-3 post-quantum
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
• QFESTA: efficient algorithms and parameters for FESTA using quaternion algebras
• Multidimensional quantum walks
• Finding Is as Easy as Detecting for Quantum Walks
• Oblivious pseudorandom functions from isogenies
• Quantum algorithm for the multicollision problem

This page was built for publication: Claw finding algorithms using quantum walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034536)