Hi, JUCE team,

I hope you’re doing well.

I spent some time last week comparing JUCE’s RSAKey implementation with standard implementations.

I’m posting this to get some more information about how they differ and what the function of JUCE’s additions might be compared to others.

Getting into specifics: this line seems to match the RSA encryption primitive described here perfectly.

The surrounding code is kind of mystery though! Does this logic correspond to a padding scheme or a preparatory step in a standard somewhere? And what’s the function of enclosing while loop that seems to have the potential to run the encryption primitive repeatedly?

So far it’s been a bit tricky to find out more.