Lower bounds for the depth of modular squaring.
Benjamin WesolowskiRyan WilliamsPublished in: IACR Cryptol. ePrint Arch. (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound
- depth information
- branch and bound algorithm
- modular structure
- objective function
- upper and lower bounds
- lower and upper bounds
- lower bounding
- np hard
- depth map
- quadratic assignment problem
- randomly generated problems
- sample complexity
- concept class
- linear programming relaxation
- depth estimation
- vc dimension
- query processing
- search space
- search algorithm