The Complexity of Public-Key Cryptography
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3846870
- Complexity Measures for Public-Key Cryptosystems
- scientific article; zbMATH DE number 4106765
- Complexity and Cryptography
- scientific article; zbMATH DE number 2066371
- Cryptology and complexity theories
- Kolmogorov complexity and cryptography
- Complexity theoretic aspects of some cryptographic functions
- Some Perspectives on Complexity-Based Cryptography
- Public key cryptography and coding theory
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 3865148 (Why is no real title available?)
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 3574966 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1852136 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- A decade of lattice cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- A quantum algorithm for computing isogenies between supersingular elliptic curves
- A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over \(\text{GF}(q)\)
- An Almost m-wise Independent Random Permutation of the Cube
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Average Case Complete Problems
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Bit commitment using pseudorandomness
- Bonsai trees, or how to delegate a lattice basis
- Breaking the sub-exponential barrier in obfustopia
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate one-way functions based on expander graphs
- Classical hardness of learning with errors
- Cliques in random graphs
- Constructing elliptic curve isogenies in quantum subexponential time
- Contemplations on Testing Graph Properties
- Cryptographic hardness of random local functions -- survey
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Elliptic Curve Cryptosystems
- Expander graphs and their applications
- Expected complexity of graph partitioning problems
- Foundations of Cryptography
- Foundations of Cryptography
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
- Hiding cliques for cryptographic security
- Hiding information and signatures in trapdoor knapsacks
- How (not) to instantiate ring-LWE
- How to use indistinguishability obfuscation
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Large Cliques Elude the Metropolis Process
- Lattice problems in NP ∩ coNP
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
- Limits on the power of indistinguishability obfuscation and functional encryption
- Lossy Trapdoor Functions and Their Applications
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- More on average case vs approximation complexity
- New directions in cryptography
- New lattice based cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model
- On colouring random graphs
- On lattices, learning with errors, random linear codes, and cryptography
- On public key encryption from noisy codewords
- On the (im)possibility of obfuscating programs
- On the Existence of Pseudorandom Generators
- On the Security of HFE, HFEv- and Quartz
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
- On the security of Goldreich's one-way function
- On total functions, existence theorems and computational complexity
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Public-key cryptography from different assumptions
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum Computation and Lattice Problems
- Recovering short generators of principal ideals in cyclotomic rings
- Secure communications over insecure channels
- Sharp thresholds of graph properties, and the k-sat problem
- Simple permutations mix well
- Structure vs combinatorics in computational complexity
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- Sum-of-squares proofs and the quest toward optimal algorithms
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
Cited in
(20)- Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons
- Public-key cryptography from different assumptions
- Towards general-purpose program obfuscation via local mixing
- Complexity Measures for Public-Key Cryptosystems
- The combinatorial complexity of masterkeying
- scientific article; zbMATH DE number 4106765 (Why is no real title available?)
- Minicrypt primitives with algebraic structure and applications
- Cryptographic assumptions: a position paper
- Advances in Cryptology - CRYPTO 2003
- scientific article; zbMATH DE number 975406 (Why is no real title available?)
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Pseudorandom sets in Grassmann graph have near-perfect expansion
- Why computational complexity may set impenetrable barriers for epistemic reductionism
- Additive randomized encodings from public key encryption
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Public keys
- scientific article; zbMATH DE number 3846870 (Why is no real title available?)
- On the impossibility of key agreements from quantum random oracles
- Distributed Merkle's puzzles
- The complexity of certain multi-exponentiation techniques in cryptography
This page was built for publication: The Complexity of Public-Key Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021130)
