fixed-size mpn_mul_n for small n?

[Torbjorn Granlund]

nisse at lysator.liu.se (Niels Möller) writes:

  I have started to look a little into elliptic curve cryptography, and
  there the sizes are pretty small. E.g., Using the standard curve over a
  256-bit prime means that numbers are just four limbs on a 64-bit
  machine. So in this case, I'd expect a specialized a completely unrolled
  squaring function for this size could make a real difference.
  
The x86_64 sqr_basecase has special code for n <= 4.

-- 
Torbjörn