The source could not be displayed because it is larger than 1.0 MB.
You can
load it anyway 或 download it
instead.
-
由 Ignat Korchagin 提交于
Changes from v1: * replace some accidental spaces with tabs In commit f145d411 ("crypto: rsa - implement Chinese Remainder Theorem for faster private key operations") we have started to use the additional primes and coefficients for RSA private key operations. However, these additional parameters are not present (defined as 0 integers) in the RSA test vectors. Some parameters were borrowed from OpenSSL, so I was able to find the source. I could not find the public source for 1 vector though, so had to recover the parameters by implementing Appendix C from [1]. [1]: https://nvlpubs.nist.gov/nistpubs/SpecialPublications/NIST.SP.800-56Br1.pdf Fixes: f145d411 ("crypto: rsa - implement Chinese Remainder Theorem for faster private key operations") Reported-by: NTasmiya Nalatwad <tasmiya@linux.vnet.ibm.com> Signed-off-by: NIgnat Korchagin <ignat@cloudflare.com> Signed-off-by: NHerbert Xu <herbert@gondor.apana.org.au>
79e6e2f3