3 ms·
Some words of advice: Don't make up your own crypto. I didn't look at what your construction is, but there appears to be a flaw in the implementation. Your cod
by sweis 17y ago
Some words of advice: Don't make up your own crypto.
I didn't look at what your construction is, but there appears to be a flaw in the implementation. Your code does not generate a strong primes for the modulo. So, the order of the cylic group may be small.
You generally want p = 2q+1, where q is a large prime. Then there are only two subgroups of order 2 and q.
For your example prime 9062412837773369110292196105482480248709337252604489001268564868178757630921032967632809984689867835102097066512990361073635001670558988501315334600583471 is definitely not strong, so Z_p^* has many small subgroups.
- RiderOfGiraffes 17y agoI 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?