good chemistry is complicated, and a little bit messy -LW |
|
PerlMonks |
Re^6: Comparative satisfiability of regexps.by Aristotle (Chancellor) |
on Jan 21, 2005 at 12:20 UTC ( [id://423943]=note: print w/replies, xml ) | Need Help?? |
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.
In Section
Seekers of Perl Wisdom
|
|