Path: csiph.com!eternal-september.org!feeder.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.forth
Subject: Re: string-stack.4th
Date: Mon, 17 Apr 2017 01:19:51 -0700
Organization: A noiseless patient Spider
Lines: 10
Message-ID: <87tw5no388.fsf@nightsong.com>
References: <afd5683b-1be6-4965-91bc-c84e7068c3a1@googlegroups.com> <2687ca1c-6423-4ffd-a2d7-707da416569d@googlegroups.com> <aaa0e4a9-4f3f-45cf-8b24-2faea0ca9f6e@googlegroups.com> <4bce5098-0505-41b7-8bf6-4263846d3bb2@googlegroups.com> <41c816a2-6258-4e2d-8693-2cf2a7cd8d6c@googlegroups.com> <562e4faf-9de1-4f9e-b0b2-ef25e97f222b@googlegroups.com> <3db60aeb-6eb3-4445-bef2-7fd241c8b89c@googlegroups.com>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org; posting-host="be3671489abb83ad0fb070dbe4c82569"; logging-data="2693"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18InAGQns5dCWjGv3chY0WG"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux)
Cancel-Lock: sha1:BmK/iD1FAc3p4iN5m4xPHHPwm1o= sha1:dTmtxUEymDGKiIh+fbP9jzFArW4=
Xref: csiph.com comp.lang.forth:57482

lehs <skydda.barnen@gmail.com> writes:
> I might be able to speed up my bigintegers.4th

I wonder if you could run a test for me: let p = 17**250 + 2704
(this number happens to be prime) and time how long it takes for
your implementation to do a Fermat test: calculate (3**p) mod p
which should be equal to 3.

My feeling is that if this takes less than a few seconds, your package
is reasonably usable for public-key cryptography.