Ononot — A 'Strong Prime' p in cryptography often requires p-1 and p+

Guest Session: 1 Question Remaining. Create Account to save progress.

Primeshard

0:00.0

A 'Strong Prime' $p$ in cryptography often requires $p-1$ and $p+1$ to have large prime factors. This is primarily to defend against which attack?