Hi, > This patch offers an efficient and side-channel protected implementation of > 1024-bit Modular Exponentiation, which is useful for RSA2048. > > The implementation is based on the "redundant representation" method, that > Helps accelerating modular exponentiation, when using SIMD architectures. > The method is described in detail in [1].
The code is integrated in slightly modified from. Most notably it was optimized to achieve additional 10% improvement [totaling in >70% overall improvement over OpenSSL 1.0.1] for RSA2048 sign. See http://git.openssl.org/gitweb/?p=openssl.git;a=blob;f=crypto/bn/asm/rsaz-avx2.pl;h=33f20e64a163209424235fa2344d93e0c8f64b7d;hb=0b4bb91db65697ab6d3a0fc05b140887cbce3080 and http://git.openssl.org/gitweb/?p=openssl.git;a=blob;f=crypto/bn/rsaz_exp.c;h=57591b8db34f2076b53dda1be015e922e918ade5;hb=ca48ace5c52feb0082954fff00a44e1914b9e7e9. > [1] Shay Gueron, Vlad Krasnov, "Software Implementation of Modular > Exponentiation, > Using Advanced Vector Instructions Architectures", Proceedings of The > International > Workshop on the Arithmetic of Finite Fields (WAIFI 2012), LNCS 7369: 119-135 > (2012). > > ... ______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List [email protected] Automated List Manager [email protected]
