scientific article
From MaRDI portal
Publication:3522446
zbMath1152.81800arXivquant-ph/0301141MaRDI QIDQ3522446
Publication date: 3 September 2008
Full work available at URL: https://arxiv.org/abs/quant-ph/0301141
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (25)
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms ⋮ Group ring based public key cryptosystems ⋮ The matrix reloaded: multiplication strategies in FrodoKEM ⋮ Layering quantum-resistance into classical digital signature algorithms ⋮ Simulations of Shor's algorithm using matrix product states ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ Quantum algorithm for solving hyperelliptic curve discrete logarithm problem ⋮ Concrete quantum cryptanalysis of binary elliptic curves via addition chain ⋮ 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 ⋮ Non-associative public-key cryptography ⋮ Side Channels in the McEliece PKC ⋮ Committing to Quantum Resistance, Better: A Speed-and-Risk-Configurable Defence for Bitcoin Against a Fast Quantum Computing Attack ⋮ Quantum algorithm design: techniques and applications ⋮ Saber on ESP32 ⋮ Bitcoin Crypto–Bounties for Quantum Capable Adversaries ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption ⋮ Quantum algorithm to find invariant linear structure of \(MD\) hash functions ⋮ 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 ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
This page was built for publication:
