New answers tagged

2

Let's have a look at how these are implemented: RSA RSA is probably the example, showing how prime numbers are used in cryptography. In order to calculate a private key, two prime numbers, $p$ and $q$ are "chosen". What that means in practice is that your computer will generate a random number (and set a few bits) and then check whether or not the ...


0

For most purposes, your computer generates a random prime. It does this by taking a random odd number and checking whether that's prime. Repeat until such a number has been found. In some cases, it is possible to create cryptographic material with your own, chosen, prime numbers. For example, RSA keys consist of two prime numbers multiplied together. If you ...


Top 50 recent answers are included