scientific article; zbMATH DE number 7716603

DOI10.4086/cjtcs.2023.001arXiv1911.01662MaRDI QIDQ6176155

Antoine Joux, Miklos Santha, Gábor Ivanyos

Publication date: 25 July 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

discrete logarithmblack-box groupsDiffie-Hellman problemsclassical and quantum complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• Polynomial degree vs. quantum query complexity
• Black box classical groups
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing
• Quantum algorithms for solvable groups
• Quantum lower bounds by polynomials
• Automata, Languages and Programming
• Lower Bounds for Local Search by Quantum Arguments
• Quantum Query Complexity of State Conversion
• Quantum lower bounds by quantum arguments

This page was built for publication: