Re: [Cfrg] Benchmarks: 384 vs 389 vs Goldilocks vs ... on Haswell

["Paterson, Kenny" <[e-mail]>]

Hi Mike,

Thanks a lot for doing this work, especially over the holiday season -
it's much appreciated.

My take-away from your work is that there's no strong reason (in
performance terms) to prefer P389 over P384-mers or vice-versa - the 8-9%
difference is there, yes, but could easily disappear or increase with
further optimisations on either side.

Does that seem fair to you? Please feel free to give an alternative
interpretation if you like.

Regards,

Kenny 

On 29/12/2014 23:14, "Mike Hamburg" <[e-mail]> wrote:

>
>
>
>Hi all, 
>
>The chairs requested that I implement and benchmark 2^389 - 21, suggested
>by Ilari.
>
>I've benchmarked several primes that have been discussed on this list.  I
>used a Haswell machine running Linux test everything, including MSR
>ECCLib 1.1.  Cycle counts for mul/sqr:
>
>MSR ECCLib (all asm, but no BMI2):
>P256-mers: M = 59.2, S = 47.8.
>P384-mers: M = 117.5, S = 89.8.
>P512-mers: M = 199.9, S = 140.6.
>
>My code (C with BMI2 mul+acc intrinsics):
>P389: M = 112.5, S = 75.5.
>Goldilocks P448: M = 118.0, S = 88.9.
>Ridinghood P480: M = 118.2, S = 89.1.
>NIST P521: M = 145.5, S = 110.7.
>
>With this machine/compiler combination, 2^389 - 21 is showing at about
>8-9% faster than MSR 384-mers and Goldilocks, which are within 0.1% of
>each other.
>
>CPU:
>Intel(R) Core(TM) i7-4790 CPU @ 3.60GHz .
>
>Compiler:
>Ubuntu clang version 3.5-1ubuntu1 (trunk) (based on LLVM 3.5)
>Target: x86_64-pc-linux-gnu
>Thread model: posix
>
>Notes: 
>
>* All benchmarks computed by timing and multiplying by 3.5932GHz, since
>that's what calib() spat out.
>
>
>* The P389 code is mul-after-add clean.  I did this by multiplying the
>arguments to a multiply separately by 8 and 21.  The code without this
>feature is marginally (<1%) faster.
>
>* I haven't tested the correctness of the P389 code, nor have I built it
>into a curve.  So sue me, I'm on vacation.
>
>* ECCLib, P389*, P448: 10^8 trials, noinline'd functions, 32-byte-aligned
>stack buffers, no dependencies in the multiplications.  TurboBoost and
>HyperThreading disabled.  Benchmarks are stable to about 3 significant
>figures.
>
>
>* P480, P521, because I'm lazy: Goldilocks `make bench`, 10^8/2 trials,
>noinlined functions, 32-byte-aligned stack buffers, no dependencies.
>Almost exactly
> consistent when benchmarking P448.
>
>* For MSR ECCLib I called directly into ecc384.o's functions, using the
>same benchmarking framework code as for P389.
>
>* Earlier, offlist testing on a Haswell MacBook Air showed about a 2%
>advantage to 2^389 - 21 instead of 8%.  The code improvements to P389
>since then are not sufficient to explain the better results: they are
>apparently machine/compiler dependent.  I thought
> that Clang 3.5 might be responsible, since I've seen performance
>differences in arithmetic code with it.  But clang-3.3, 3.4 and 3.5 all
>give similar results for those primes.  GCC 4.9 gives slightly worse
>results for everything but the MSR asm code.
>
>* The P389 code is probably less tuned than its competitors. The MS code
>is written in pure asm, but it doesn't take advantage of BMI2.  The
>Goldilocks and P389 code are C with an asm multiply/accumulate intrinsic,
>but I spent more time tuning the Goldilocks
> code. 
>
>* The Ridinghood code is the same as the Goldilocks code with different
>shift constants.  The P-521 code is the arch_x86_64_r12 version, using 9
>limbs vector-aligned to a 12-word structure.
>
>* I have no data about 2^389 - 21 on other platforms, but offlist
>discussions suggest that it will be OK, if perhaps annoying to implement,
>on 32-bit platforms.
>
>Cheers, 
>-- Mike
>
>