Cryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity.
Eric AllenderJohn GouwarShuichi HiraharaCaleb RobellePublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- kolmogorov complexity
- inductive inference
- complexity measures
- computational complexity
- smart card
- np hardness
- discrete tomography
- radon transform
- neural network
- tomographic reconstruction
- key management
- hash functions
- np complete
- worst case
- three dimensional
- phase transition
- encryption key
- security protocols
- rough sets
- semi supervised
- np hard
- lower bound
- decision trees