2 ms·
I believe both attacks described here require the modulus to be composite not prime. Wouldn't then the only necessary review necessary be to check the primalit
by rocqua 10y ago
I believe both attacks described here require the modulus to be composite not prime. Wouldn't then the only necessary review necessary be to check the primality of the modulus used in DH?
- dogma1138 10y agoPrimality tests are effectively brute force computations, if your adversary has considerably more compute power than you they could calculate values that you would not be able to identify as being composite. For example SSH-Keygen uses the Miller-Rabin[0] test on the moduli and depending on the bit size if your number and the number of rounds you get a probability of how likely it is that the number is prime or not, but effectively there is never a guarantee because of the size of the numbers in question. The likelihood of an adversary being able to compute a value that you would consider to be prime but infact it would not be is directly tied to the size of the number, the method of verification you are using, and how much resources you are spending to evaluate that number. Given an adversary that in all likelihood completely outclasses you in computational capacity, and is also likely to be able to develop more efficient algorithms than those available to you there is a pretty good chance that they will able to backdoor you every time without you having an effective counter measure or the ability to detect it if they choose to do so. [0]https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality...