Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields

DOI10.1007/s11128-023-04017-xMaRDI QIDQ6171431

Yan Huang, Peidong Guan, Fangguo Zhang, Chao Chen

Publication date: 11 August 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

zbMATH Keywords

hyperelliptic curvesdiscrete logarithm problemJacobiansquantum cryptanalysisShor's algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperelliptic cryptosystems
• Quantum resource estimates for computing elliptic curve discrete logarithms
• qDSA: small and secure digital signatures with curve-based Diffie-Hellman key pairs
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems
• Jacobian coordinates on genus 2 curves
• Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
• Kummer Strikes Back: New DH Speed Records
• Quantum algorithms for algebraic problems
• Factorization with genus 2 curves
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
• Elliptic and Hyperelliptic Curves: A Practical Security Analysis
• Fast genus 2 arithmetic based on Theta functions

This page was built for publication: Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields