scientific article; zbMATH DE number 7716603

DOI10.4086/CJTCS.2023.001MaRDI QIDQ6176155zbMATH OpenFDO

Authors Gábor Ivanyos, Antoine Joux, Miklos Santha

Publication date 25 July 2023

Full work available at URL https://arxiv.org/abs/1911.01662

zbMATH Keywords

black-box groupsclassical and quantum complexityDiffie-Hellman problemsdiscrete logarithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Automata, Languages and Programming
• Black box classical groups.
• Decomposing finite Abelian groups
• scientific article; zbMATH DE number 5485488 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3664349 (Why is no real title available?)
• scientific article; zbMATH DE number 3480679 (Why is no real title available?)
• scientific article; zbMATH DE number 1284153 (Why is no real title available?)
• Lower Bounds for Local Search by Quantum Arguments
• Polynomial degree vs. quantum query complexity
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum algorithms for solvable groups
• Quantum lower bounds by polynomials
• Quantum lower bounds by quantum arguments
• Quantum Query Complexity of State Conversion
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• Strengths and Weaknesses of Quantum Computing
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms

Cited in

(2)

• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• SZK proofs for black-box group problems

This page was built for publication:

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