scientific article; zbMATH DE number 5320241
From MaRDI portal
Publication:3522446
Recommendations
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Improved quantum circuits for elliptic curve discrete logarithms
- Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields
- An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- Optimized quantum implementation of elliptic curve arithmetic over binary fields
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
- Shor's r-algorithms: theory and practice
Cited in
(47)- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Simulations of Shor's algorithm using matrix product states
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Quantum algorithm design: techniques and applications
- HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- Quantum algorithm to find invariant linear structure of MD hash functions
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
- The matrix reloaded: multiplication strategies in FrodoKEM
- Layering quantum-resistance into classical digital signature algorithms
- Saber on ESP32
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Non-associative public-key cryptography
- An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
- Committing to quantum resistance, better: a speed-and-risk-configurable defence for bitcoin against a fast quantum computing attack
- Optimized quantum implementation of elliptic curve arithmetic over binary fields
- Side Channels in the McEliece PKC
- scientific article; zbMATH DE number 1030974 (Why is no real title available?)
- Fast Reed-Solomon interactive oracle proofs of proximity
- Improved quantum circuits for elliptic curve discrete logarithms
- Group ring based public key cryptosystems
- Bitcoin Crypto–Bounties for Quantum Capable Adversaries
- A key exchange protocol using matrices over group ring
- Transitive Signatures from Braid Groups
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
- Higher-order masked Saber
- Quantum circuits for hyperelliptic curve discrete logarithms over the mersenne prime fields
- The special case of cyclotomic fields in quantum algorithms for unit groups
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- An identity-based blind signature scheme using lattice with provable security
- Reduction of the semigroup-action problem on a module to the hidden-subgroup problem
- VDOO: a short, fast, post-quantum multivariate digital signature scheme
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Quantum complexity for discrete logarithms and related problems
- Space-efficient and noise-robust quantum factoring
- Space-efficient and noise-robust quantum factoring
- Extending Regev's quantum algorithm to elliptic curves
- Fast Fourier transform and Gaussian sampling instructions designed for FALCON digital signature
- Quantum algorithm for solving discrete logarithm problem on Jacobians of genus 3 hyperelliptic curves
- Improved quantum circuits for elliptic curve discrete logarithm problems on Ed25519
- ZKFault: fault attack analysis on zero-knowledge based post-quantum digital signature schemes
- Reducing the number of qubits in quantum discrete logarithms on elliptic curves
- A quantum secure ID-based cryptographic encryption based on group rings
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 Q3522446)