Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs.
Patrick BaillotGilles BartheUgo Dal LagoPublished in: J. Autom. Reason. (2019)
Keyphrases
- computational complexity
- smart card
- high computational complexity
- special case
- np complete
- computationally efficient
- decision problems
- neural network
- low complexity
- computational cost
- artificial intelligence
- theorem prover
- hash functions
- storage requirements
- security protocols
- data sets
- rate distortion
- information systems
- learning algorithm
- computational load
- precise definition
- formal proof
- equational theories
- differential power analysis