id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
12022,CRT optimised powm(),Domagoj Šarić,John Maddock,"multiprecision::powm() with unchecked uints is _much_ slower (i.e. I actually perceive the time it takes for the function to return on an 4GHz i5 in release builds) than say the equivalent libtomcrypt/math operation. I'm guessing the major reason for this is the CRT[1] optimisation (or lack thereof in multiprecision).
So, can you implement a CRT 'enabled' powm overload (I presume this would also require a function for factoring a large multiprecision uint into to dp, dq, etc. factors)?

[1]
https://en.wikipedia.org/wiki/RSA_(cryptosystem)#Using_the_Chinese_remainder_algorithm
http://crypto.stackexchange.com/questions/2575/chinese-remainder-theorem-and-rsa",Feature Requests,new,To Be Determined,multiprecision,Boost 1.61.0,Optimization,,,