![]() |
|
|
#1 |
|
"Nancy"
Aug 2002
Alexandria
2,467 Posts |
Hi,
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? Alex |
|
|
|
|
|
#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.
Quote:
|
|
|
|
|
![]() |
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 |