Go Back > Great Internet Mersenne Prime Search > Hardware

Thread Tools
Old 2005-08-04, 09:43   #1
akruppa's Avatar
Aug 2002

2,467 Posts
Default VIA C7 Montgomery Multiplier?


feature lists for the upcoming VIA C7 processor include a "Montgomery Multiplier supporting key sizes up to 32K" (google). Could this be useful for computational number theory as well? Does anyone have more info about this, i.e. which functionality this multiplier offers and throughput?

akruppa is offline   Reply With Quote
Old 2005-08-04, 10:25   #2
May 2004

24×5 Posts

Tom Crispin from Centaur Technology emailed the gmp-devel list in December asking for help with adding this feature to gmp.

I'm seeing about a 4x speedup in modulo exponentiation (and thus in RSA operations) using our new instruction, relative to GMP. What we would like to see is direct support for our hardware in GMP itself.
dave_dm is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Multiplier search to find almost-squares mathPuzzles Computer Science & Computational Number Theory 6 2017-09-18 13:28
Peter Montgomery's Thesis mickfrancis Computer Science & Computational Number Theory 3 2015-06-25 14:32
Benchmarks varying FSB, Memory Latency and multiplier S485122 Software 0 2006-11-08 20:21
Montgomery powering T.Rex Math 10 2006-04-18 06:57
Montgomery Multiplication dave_dm Math 2 2004-12-24 11:00

All times are UTC. The time now is 04:43.

Tue Mar 9 04:43:28 UTC 2021 up 96 days, 54 mins, 0 users, load averages: 1.02, 1.19, 1.35

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.