Deutsch English Français Italiano |
<871q757j96.fsf@fatphil.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Phil Carmody <pc+usenet@asdf.org> Newsgroups: sci.crypt Subject: Re: Fast Modular Exponentiation with Huge Exponents Date: Tue, 16 Apr 2024 12:24:21 +0300 Organization: A noiseless patient Spider Lines: 16 Message-ID: <871q757j96.fsf@fatphil.org> References: <b1fbf007d052918737b3ad5b1987fa27$1@sybershock.com> MIME-Version: 1.0 Content-Type: text/plain Injection-Date: Tue, 16 Apr 2024 11:24:21 +0200 (CEST) Injection-Info: dont-email.me; posting-host="f15427b9add8b35cb29e5b964a2d25b1"; logging-data="926848"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19GOWD2bORTGZi271OhY6yV" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/26.1 (gnu/linux) Cancel-Lock: sha1:JzcvXUI+HYIvqMN5xzLBSqaItek= sha1:u9XbxdhvnIUxinRsbizXw6Q2Vno= Bytes: 1712 SugarBug <3883@sugar.bug> writes: > I am seeking different efficient programming methods (algorithms) for > modular exponentiation with huge exponents, viz. 160-bit to 1024-bit .... > I am not the least bit interested in using 3rd party code for this > project. Please point the way to _algorithms_, not libraries or units. /Prime Numbers and Computer Methods for Factorization/ - Hans Riesel /Prime Numbers: A Computational Perspective/ - Crandall & Pomerance Phil -- We are no longer hunters and nomads. No longer awed and frightened, as we have gained some understanding of the world in which we live. As such, we can cast aside childish remnants from the dawn of our civilization. -- NotSanguine on SoylentNews, after Eugen Weber in /The Western Tradition/