2 ms·
I know that in a complete implementation I should be using 2q+1 where q is a Sophie Germain prime. The implementation is deliberately unencumbered by anything n
by RiderOfGiraffes 17y ago
I know that in a complete implementation I should be using 2q+1 where q is a Sophie Germain prime. The implementation is deliberately unencumbered by anything not directly related to the actual process.
And I'm not inventing my own crypto. If you do take a look at the construction you will see that it's actually very well-known.
I appreciate your comments. They show me where the article will need to be extra clear.
Are you going to have a go at claiming the prize?