Why are Prime Numbers so frequently used in Security Systems?

Is it related to the fact that we do not know any rule regarding their distribution to date?

For example we have generated lists of several billion Consecutive Prime Numbers and it turns out that there does not seem to be a rule regarding the gaps between each number or at least not on an acceptable human scale .. ... .....

There does not seem to be a rule regarding the gaps between each number …

Here you can download 2 of our small generated lists, the first one containing the first 10'000'000 and the second one containing the first 100'000'000 consecutive Prime Numbers all listed in the correct order with their exact positions, as well as the gap between each number.

Are there any available very long and detailled lists of Large Prime Numbers that allow for larger-scale analysis of the gaps between numbers ?

Or is there a mathematical rule to quantify those number gap or to know their emerging sequence?

Thank you in advance for your answers .. ... .....

Ex0 SySCreationAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

ste5anSenior DeveloperCommented:
If you're interested in this kind of Mathematics, then you need some studying about Riemann's work and his zeta function.

But this really hard stuff. The conjecture based on the zeta function, called Riemann hypothesisis part of the Millenium Problems list of the Clay Mathematics Institute. You'll get 1 million $, when you either proof right or wrong.

And for the question in your subject: Cause the factorization problem is a hard to calculate problem
Why are Prime Numbers so frequently used in Security Systems?

A very good question, which leads to another good question:
If you aren't sure, why did you use them in your security system?

The distribution of primes has been studied extensively:

As have the gaps between primes:

There is also recent work, looking for patterns in the first 400 billion primes:

400 billion is only  4 x 10^11.  But people have found all the primes up to 10^18

The last link also indicates why lists of primes are not that useful:
     Small primes are too easy to find. The can be found far faster than they can be read from a hard disk.
     Long lists just waste storage, and if placed on the Internet, they just waste bandwidth.
Why are Prime Numbers so frequently used in Security Systems?

Actually, I believe systems based on prime numbers are out of favor because the large key sizes required to insure security are very inefficient.  
RSA does use primes, but it also allows for public and private keys, and so it is still the standard for key exchange.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
Acronis True Image 2019 just released!

Create a reliable backup. Make sure you always have dependable copies of your data so you can restore your entire system or individual files.

Ex0 SySCreationAuthor Commented:
Thank you for your answers.

Of course, we know that Mr. Riemann's work is one of the key elements of this issue.

If we use Prime Numbers as part of our security system (very small one), it is only because we have found a way to make the calculation of prime numbers faster than the current known systems.

We did not create a new algorithm for the number primality test, but a preprocessing algorithm that allows for much faster results in combination with the best known algorithms.

For example, to calculate the list of 100'000'000 consecutive prime numbers (this is a very small list) and this in Mono-CPU-Thread mode, we obtained a time saving of 6% compared to the use only the Miller-Rabin algorithm contained in the famous GMP library.

We are in the process of completing the development of the Multi-Threading part of our pre-processing algorithm, we will post the performance results once the first lists are calculated.

Thank you for your interest.

Best regards,
Ed CovneyRetiredCommented:
The prime numbers used in encryption systems are much larger than you've imagined. Ron Rivest (the R in RSA) asked this question to academia in about 1995, "The Factoring Challenge". Can you factor this number into two primes:

The factors  are:
342526708406385189575946388957261768583317   and

Google either prime number or ("The Factoring Challenge") or go to:

BTW: Ron Rivest is the creator of the Message Digest series ending with MD5.
I think this has been resolved.
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
prime numbers

From novice to tech pro — start learning today.