algorithm suggested in following paper:

Câmara, D.; Gouvêa, C. P. L.; López, J. & Dahab, R.: Fast Software
Polynomial Multiplication on ARM Processors using the NEON Engine.

http://conradoplg.cryptoland.net/files/2010/12/mocrysen13.pdf

This also eliminates code duplication between x86_64-mont and x86_64-mont
and optimizes even original non-MULX code.

PR: 3189
Submitted by: Oscar Ciurana

rsaz_exp.c: harmonize line terminating;
asm/rsaz-*.pl: minor optimizations.

Latest MIPS ISA specification declared 'branch likely' instructions
obsolete. To makes code future-proof replace them with equivalent.

RT: 2582, 2850

Improve RSA sing performance by 20-30% by:
- switching from floating-point to integer conditional moves;
- daisy-chaining sqr-sqr-sqr-sqr-sqr-mul sequences;
- using MONTMUL even during powers table setup;

PR: 3074

eliminating them as dead code.

Both volatile and "memory" are used because of some concern that the compiler
may still cache values across the asm block without it, and because this was
such a painful debugging session that I wanted to ensure that it's never
repeated.

PR: 3004

PR: 2963 and a number of others

PR: 2963 and a number of others

Submitted by: Florian Weimer

Submitted by: David Miller, Andy Polyakov

place at a time, by pre-processor in .S case and perl - in .s).

path with spaces.

PR: 2835