A Note on the Hardness of Problems from Cryptographic Group Actions

Giuseppe D'Alconzo

Given a cryptographic group action, we show that the Group Action Inverse Problem (GAIP) and other related problems cannot be NP-hard unless the Polynomial Hierarchy collapses. We…