in reply to Re^5: Comparative satisfiability of regexps.
in thread Comparative satisfiability of regexps.

That analogy is flawed. That's how public key cryptography is implemented in practice, for practical reasons, to be sure. It's not how the cryptographic algorithms are constructed mathematically, however. And of course there's the quantifiable vs Monte Carlo difference Meowse mentioned.

Makeshifts last the longest.

  • Comment on Re^6: Comparative satisfiability of regexps.