Definition in Cryptography
In cryptography, a prime number is strong if the following conditions are satisfied.
- is sufficiently large to be useful in cryptography; typically this requires to be too large for plausible computational resources to enable a cryptanalyst to factorise products of multiplied by other strong primes.
- has large prime factors. That is, for some integer and large prime .
- has large prime factors. That is, for some integer and large prime .
- has large prime factors. That is, for some integer and large prime .
Sometimes a prime that satisfies a subset of the above conditions is also called strong. In some cases, some additional conditions may be included. For example, or, etc.
Read more about this topic: Strong Prime
Famous quotes containing the words definition in and/or definition:
“Was man made stupid to see his own stupidity?
Is God by definition indifferent, beyond us all?
Is the eternal truth man’s fighting soul
Wherein the Beast ravens in its own avidity?”
—Richard Eberhart (b. 1904)
“The definition of good prose is proper words in their proper places; of good verse, the most proper words in their proper places. The propriety is in either case relative. The words in prose ought to express the intended meaning, and no more; if they attract attention to themselves, it is, in general, a fault.”
—Samuel Taylor Coleridge (1772–1834)