A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search.
Jean-Sébastien CoronJean-Charles FaugèreGuénaël RenaultRina ZeitounPublished in: IACR Cryptol. ePrint Arch. (2013)
Keyphrases
- exhaustive search
- computational complexity
- brute force
- worst case
- improved algorithm
- space complexity
- cost function
- dynamic programming
- detection algorithm
- expectation maximization
- np hard
- computational cost
- experimental evaluation
- single pass
- search space
- preprocessing
- recognition algorithm
- computationally efficient
- high efficiency
- complexity analysis
- polynomial time complexity
- times faster
- simulated annealing
- high accuracy
- significant improvement
- objective function
- memory requirements
- solution space
- matching algorithm
- theoretical analysis
- neural network
- particle swarm optimization
- computationally feasible