FFT algorithm for BIGNUM multiplication

[Michael Wojcik]

> From: openssl-users [mailto:openssl-users-bounces at openssl.org] On Behalf Of Jaskamal Kainth
> Sent: Monday, April 27, 2020 23:38

> Can someone help me with my query for the additional feature request?
> https://github.com/openssl/openssl/issues/11658

Help you how? This is the openssl-users list. What you're asking about isn't a feature of OpenSSL, so none of the OpenSSL users use it.

You opened that issue *yesterday*, and it's already been responded to. What more do you want?

> Also, I want to know why we haven't implemented and integrated FFT for bignum multiplication

"We" who? I know why *I* haven't implemented it: because I have no need for it, because there's no justification for implementing it in this context (see bbbrumley's response to your issue), and because it's not my area. Presumably you know why *you* haven't implemented it. I assume no one else has implemented it (in OpenSSL) because no one else sees any reason to do so.

> till now?

"til now". "til" is a contraction of "until". "till" means to break the surface of the soil, to prepare a field for planting. (Also, "til now" is uncommon usage in many English dialects, where "already" is generally preferred; but English is so crowded with dialectisms that's not really worth worrying about unless you're trying to avoid them.)

--
Michael Wojcik
Distinguished Engineer, Micro Focus