- 20 4月, 2015 1 次提交
-
-
由 Andy Polyakov 提交于
Reviewed-by: NMatt Caswell <matt@openssl.org> Reviewed-by: NRichard Levitte <levitte@openssl.org>
-
- 08 3月, 2015 1 次提交
-
-
由 Andy Polyakov 提交于
Reviewed-by: NTim Hudson <tjh@openssl.org>
-
- 05 1月, 2015 1 次提交
-
-
由 Andy Polyakov 提交于
This facilitates "universal" builds, ones that target multiple architectures, e.g. ARMv5 through ARMv7. See commentary in Configure for details. Reviewed-by: NArd Biesheuvel <ard.biesheuvel@linaro.org> Reviewed-by: NMatt Caswell <matt@openssl.org>
-
- 07 6月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
Pointer out and suggested by: Ard Biesheuvel.
-
- 24 4月, 2014 1 次提交
-
-
由 Andy Polyakov 提交于
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
-
- 02 4月, 2011 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 13 7月, 2010 1 次提交
-
-
由 Andy Polyakov 提交于
Modest improvement coefficients mean that code already had some parallelism and there was not very much room for improvement. Special thanks to Ted Krovetz for benchmarking the code with such patience.
-
- 08 7月, 2010 1 次提交
-
-
由 Andy Polyakov 提交于
ARM assembler modules.
-
- 02 7月, 2010 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 04 5月, 2010 1 次提交
-
-
由 Andy Polyakov 提交于
-