Previously, I asked what is the simplest digital signature scheme known, under the assumption simpler implementations could provide valuable insights on the nature of the problem.
Among competing hypotheses, the one with the fewest assumptions should be selected. (...) In science, Occam's razor is used as a heuristic technique (discovery tool) to guide scientists in the development of theoretical models https://en.wikipedia.org/wiki/Occam's_razor
I specifically asked for implementations that didn't use number theory, because numeric operations (division, modulus) require some added complexity to implement in any "neutral" language that doesn't have numbers.
I received a plenty of negative comments claiming simpler schemes aren't proven to be secure, that simplicity is subjective and the general sentiment was that the question was pointless.
My question, thus, defies my own beliefs: has Occam's Razor ever proven useful for cryptography at all? Is there, for example, any historic occurrence of someone starting with a complex cryptographic scheme, looking from simpler solutions, and eventually finding answers that led to a better understanding of the problem itself?