Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
Patrick BaillotGilles BartheUgo Dal LagoPublished in: LPAR (2015)
Keyphrases
- computational complexity
- smart card
- np complete
- high computational complexity
- special case
- low complexity
- rate distortion
- memory requirements
- hash functions
- theorem proving
- theorem prover
- computational cost
- security protocols
- computationally efficient
- worst case
- formal proof
- formal proofs
- data sets
- bit rate
- storage requirements
- computational load
- encryption scheme
- expert systems
- mathematical proofs