<i>&quot;For the nerds in the audience, here’s what’s wrong: If a client and server are speaking Diffie-Hellman, they first need to agree on a large prime number with a particular form. [...] an adversary can perform a single enormous computation to “crack” a particular prime [...]&quot;</i><p>Can someone explain to me what the authors mean by &quot;cracking&quot; a prime? Is the difficulty of this related to the difficulty factoring a composite number? The language used is annoyingly imprecise.<p>Edit: Question was already asked by smegel, and has some useful answers.