On the Cryptographic Hardness of Local Search.

Nir Bitansky Idan Gerichter

Published in: IACR Cryptol. ePrint Arch. (2020)

Keyphrases

search algorithm
genetic algorithm
tabu search
security protocols
smart card
memetic algorithm
global search

computational complexity
optimal solution
systematic search
np hard
np complete
phase transition
evolutionary search

hash functions
neural network
combinatorial optimization
job shop scheduling problem
key management
np hardness
simulated annealing

search space
learning theory
information theoretic
hooke jeeves
satisfiability testing
packet filtering