Beyond Explicit Generators: Distribution-Free Linear-Decomposition Attacks on Public-Key Encryption
A setting in which the adversary uses only the public sampling-and-evaluation oracle available to honest participants, the induced distribution is arbitrary, and the goal is to attack future ciphertexts rather than recover the full algebraic span is studied, yielding a generic impossibility theorem.