Tag: computational-complexity-theory

Found 23 results for 'computational-complexity-theory'.

1) rsa - Why is elliptic curve cryptography not widely used, compared to RSA?
2) post-quantum-cryptography - Are post-quantum cryptographic ciphers *also* secure if the P=NP conjecture holds true?
3) algorithm-design - Does generic group black box model prohibit MSB of discrete logarithm?
4) provable-security - Reductionist proofs of computational problems to decisional
5) rsa - Why is elliptic curve cryptography not widely used, compared to RSA?
6) symmetric - How to estimate the maximum computational cost bound for Key Derivation Functions (KDFs) before it becomes useless security-wise?
7) complexity - LWE and extended trapdoor claw free functions
8) secret-sharing - Computational Complexity Of Breaking Information Theoretic Security
9) zero-knowledge-proofs - Why Zero-Knowledge protocols are used for NP problems if IP is the class of interactive proof systems where they come from?
10) protocol-design - Why do we always assume that the functions that the protocols can replicate are of the form $f:\{0,1\}^*\to\{0,1\}^*$?
11) rsa - RSA decryption using CRT: How does it affect the complexity?
12) zero-knowledge-proofs - How to construct a circuit in zkSNARK
13) public-key - What does it mean for public keys to be in coNP
14) pseudo-random-function - Questions regarding the pseudorandom function construction of Banerjee, Peikert, and Rosen
15) cryptanalysis - Notion of elementary operation when complexities in the form of $2^{128}$
16) pseudo-random-function - LWE and pseudorandom functions
17) public-key - Has anyone implemented a public-key encryption scheme using a universal one-way function?
18) homomorphic-encryption - How expensive would running a practical application on full homomorphic encryption be?
19) block-cipher - Private key encryption based on NP-complete problem
20) complexity - Is Indistinguishability Obfuscation Real?
21) complexity - Why the differential cryptanalysis complexity is linear with inverse of the probability while linear cryptanalysis is quadratic with the bias inverse?
22) pseudo-random-generator - A question regarding next-bit predictors
23) authentication - Consequences of P=NP for Authentication