That is really lovely. I don’t know what criteria are used for Rosetta Code, but the article’s implementation is the clearest “program as concrete explication of algorithm” I’ve ever seen. It took me *years* to understand RSA’s internals to the point that I could explain it if asked to in an interview, but I suspect if I’d had that code as my example I’d have just gotten it.
It’s hard for me to be certain because I *do* know the algorithm now, of course. But from Damian’s YAPC keynote and looking at the primality tests and whatnot, I suspect my intuition is right—but for the hyperoperators, which are certainly a bit difficult for folks who haven’t done much functional programming or MapReduce-type programming, Perl 6 is some of the niftiest pseudocode I’ve ever seen. That it *runs* is just gravy. :-) On Mon, Oct 3, 2016 at 11:03 AM Patrick R. Michaud pmich...@pobox.com <http://mailto:pmich...@pobox.com> wrote: On Mon, Oct 03, 2016 at 04:26:10PM +0200, Elizabeth Mattijsen wrote: > > > On 02 Oct 2016, at 11:00, Thor Michael Støre <thormich...@gmail.com> > wrote: > > > Is this normal startup performance? > > > > https://www.promptworks.com/blog/public-keys-in-perl-6 > > > > I wonder what would be needed to run this in Perl 5, module wise, and > CPU wise. > > This also seems like an interesting task for Rosetta Code (the RSA key > generation part). > > Rosetta Code already has an entry for RSA encryption/decryption in Perl 6 > (but not Perl), but I'm wondering if the article's version is better than > Rosetta Code's existing Perl 6 entry. > > http://rosettacode.org/wiki/RSA_code#Perl_6 > > Pm >
