scientific article; zbMATH DE number 1406786
From MaRDI portal
Recommendations
Cited in
(32)- On the statistical properties of Diffie-Hellman distributions
- The GN-authenticated key agreement
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
- An observation on associative one-way functions in complexity theory
- Full quantum equivalence of group action DLog and CDH, and more
- Algorithms for black-box fields and their application to cryptography
- Generic groups, collision resistance, and ECDSA
- Cryptographic group and semigroup actions
- Diffie-Hellman Oracles
- Pairing-free blind signatures from CDH assumptions
- scientific article; zbMATH DE number 4187705 (Why is no real title available?)
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Comparing two pairing-based aggregate signature schemes
- Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
- Breaking RSA Generically Is Equivalent to Factoring
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Full quantum equivalence of group action DLog and CDH, and more
- Synthesizers and their application to the parallel construction of pseudo-random functions
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
- Cryptographic multilinear maps using pro-\(p\) groups
- Computational Number Theory and Cryptography
- On the impossibility of purely algebraic signatures
- An Analysis of the Vector Decomposition Problem
- The kernel matrix Diffie-Hellman assumption
- An elliptic curve analogue of McCurley's key agreement scheme
- On the Equivalence of Generic Group Models
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- A note on non-interactive zero-knowledge from CDH
- On relationship of computational Diffie-Hellman problem and computational square-root exponent problem
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 Q4940702)
