Werner Koch wrote:
On Mon, 11 Sep 2023 22:29, Jacob Bachmeyer said:
So using threads to compute a blinded RSA operation would just about
recover the computational cost of blinding the calculation? How would
No. I gave this as an example where you could else see on how to speed
up
On Mon, 11 Sep 2023 22:29, Jacob Bachmeyer said:
> So using threads to compute a blinded RSA operation would just about
> recover the computational cost of blinding the calculation? How would
No. I gave this as an example where you could else see on how to speed
up things. For example if you
Werner Koch via Gnupg-users wrote:
[...]
On Sat, 9 Sep 2023 22:07, Robert J. Hansen said:
and for the vast majority of users isn't worth it. The easy wins (28%
cost savings on RSA encryption! Whee, almost half a millisecond!) are
The blinding we use for RSA (to mitigate
Hi!
Thanks Rob for your comments. Here are some additional points:
On Sat, 9 Sep 2023 22:07, Robert J. Hansen said:
> and for the vast majority of users isn't worth it. The easy wins (28%
> cost savings on RSA encryption! Whee, almost half a millisecond!) are
The blinding we use for RSA (to
Thank you for reply. I was thinking about speeding up the encryption
process. But if that's not possible then that's how it is.
Thank you for sending a plain-text email to the list! :)
The answer is a little complicated, but this should be an
accurate-enough explanation.
Encryption speed
On 9/10/23 01:21, Robert J. Hansen via Gnupg-users wrote:
Please do not send HTML to this list. Many of the people you very
much hope to read your questions will not read HTML email.
Anyone knows if there is a way to use all CPU threads with
*gnupg-desktop-2.4.3.0-x86_64.AppImage* ?
What
Please do not send HTML to this list. Many of the people you very much
hope to read your questions will not read HTML email.
Anyone knows if there is a way to use all CPU threads with
*gnupg-desktop-2.4.3.0-x86_64.AppImage* ?
What exactly are you hoping to speed up? The classic mode of
