Algorithms for black-box fields and their application to cryptography
From MaRDI portal
Recommendations
Cites work
- A key distribution system equivalent to factoring
- A key-exchange system based on imaginary quadratic fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Complexity of a determinate algorithm for the discrete logarithm
- Elliptic Curve Cryptosystems
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Factoring integers with elliptic curves
- scientific article; zbMATH DE number 4214161 (Why is no real title available?)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 177614 (Why is no real title available?)
- scientific article; zbMATH DE number 475432 (Why is no real title available?)
- scientific article; zbMATH DE number 799760 (Why is no real title available?)
- scientific article; zbMATH DE number 799766 (Why is no real title available?)
- scientific article; zbMATH DE number 1406786 (Why is no real title available?)
- scientific article; zbMATH DE number 4185800 (Why is no real title available?)
- Lower bounds for algebraic decision trees
- New directions in cryptography
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On the Distribution of Quadratic Residues (mod p )
- Reducing elliptic curve logarithms to logarithms in a finite field
- Secure circuit evaluation. A protocol based on hiding information from an oracle
Cited in
(39)- Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- Polynomial interpolation and identity testing from high powers over finite fields
- Quantum algorithm design: techniques and applications
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Classical and quantum function reconstruction via character evaluation
- Pseudo-free families of computational universal algebras
- Generic-group delay functions require hidden-order groups
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- On instantiating the algebraic group model from falsifiable assumptions
- Pseudo-free families and cryptographic primitives
- On the analysis of cryptographic assumptions in the generic ring model
- Structures interpretable in models of bounded arithmetic
- An efficient signcryption scheme with forward secrecy based on elliptic curve
- Generic groups, collision resistance, and ECDSA
- Cryptographic assumptions: a position paper
- On constructing homomorphic encryption schemes from coding theory
- Diffie-Hellman Oracles
- Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
- On Black-Box Ring Extraction and Integer Factorization
- scientific article; zbMATH DE number 2079935 (Why is no real title available?)
- Homomorphic encryption and some black box attacks
- On the Equivalence of Generic Group Models
- On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
- Breaking RSA Generically Is Equivalent to Factoring
- Algebraic curves and cryptography
- On the statistical properties of Diffie-Hellman distributions
- On the security of functional encryption in the generic group model
- Homomorphic encryption: a mathematical survey
- Full quantum equivalence of group action DLog and CDH, and more
- Computing primitive idempotents in finite commutative rings and applications
- A note on non-interactive zero-knowledge from CDH
- There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups
- Full quantum equivalence of group action DLog and CDH, and more
- A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
- The pseudorandomness of Legendre symbols under the quadratic-residuosity assumption
- Polynomial-time algorithms for black-box distributive expanded groups
- Comparing two pairing-based aggregate signature schemes
This page was built for publication: Algorithms for black-box fields and their application to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452358)
