Claw finding algorithms using quantum walk

DOI10.1016/J.TCS.2009.08.030zbMATH Open1191.68327OpenAlexW1993492472MaRDI QIDQ1034536FDOQ1034536

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum Algorithms for the Triangle Problem
• Quantum Walk Algorithm for Element Distinctness
• Quantum lower bounds for the collision and the element distinctness problems
• Title not available (Why is that?)
• Quantum Query Complexity of Some Graph Problems
• Quantum cryptanalysis of hash and claw-free functions
• Title not available (Why is that?)
• Quantum Algorithms for Element Distinctness
• Computing and Combinatorics

Cited In (26)

• 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
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• An Improved Claw Finding Algorithm Using Quantum Walk
• 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
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

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)